Today flexible
manufacturing systems are highly popular due to their capability of quick
response to customer needs. Although the advantages of flexible manufacturing
systems cannot be denied, these systems also bring new issues on production
planning side. Especially assigning machines to production operations and scheduling
these operations with respect to machine constraints turn out to be an NP-Hard
problem. In this study, the integrated process routing and scheduling problem
is explained, and the performance of two different meta-heuristic techniques,
which are genetic algorithms and simulated annealing, are compared in terms of
solution time and quality.
Optimization Integrated Process Planning and Scheduling Job Scheduling Simulated Annealing Genetic Algorithms
Konular | Mühendislik |
---|---|
Bölüm | Research Article |
Yazarlar | |
Yayımlanma Tarihi | 26 Aralık 2016 |
Yayımlandığı Sayı | Yıl 2016 |