A simulated annealing approach to scheduling a manufacturing cell

Asoo J. Vakharia and Yih‐Long Chang

Naval Research Logistics (NRL), 1990, vol. 37, issue 4, 559-577

Abstract: This article proposes a new heuristic based on simulated annealing that schedules part families, as well as jobs within each part family, in a flow‐line manufacturing cell. The new scheduling approach is compared to a branch and bound algorithm as well as two other family‐based scheduling heuristics for different cell configurations. The results reveal that all the heuristics provide comparable solutions to the optimal procedure for small problems. However, when the problem size increases, the simulated annealing heuristic outperforms the other procedures not only in solution quality but also by requiring substantially less computation time.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199008)37:43.0.CO;2-8

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:37:y:1990:i:4:p:559-577

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().