A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times
2011 (English)In: Journal of Intelligent Manufacturing, ISSN 0956-5515, E-ISSN 1572-8145, Vol. 2, no 6, 956-978 p.Article in journal (Refereed) Published
One of the scheduling problems with various applications in industries is hybrid flow shop. In hybrid flow shop, a series of n jobs are processed at a series of g workshops with several parallel machines in each workshop. To simplify the model construction in most research on hybrid flow shop scheduling problems, the setup times of operations have been ignored, combined with their corresponding processing times, or considered non sequence-dependent. However, in most real industries such as chemical, textile, metallurgical, printed circuit board, and automobile manufacturing, hybrid flow shop problems have sequence-dependent setup times (SDST). In this research, the problem of SDST hybrid flow shop scheduling with parallel identical machines to minimize the makespan is studied. A novel simulated annealing (NSA) algorithm is developed to produce a reasonable manufacturing schedule within an acceptable computational time. In this study, the proposed NSA uses a well combination of two moving operators for generating new solutions. The obtained results are compared with those computed by Random Key Genetic Algorithm (RKGA) and Immune Algorithm (IA) which are proposed previously. The results show that NSA outperforms both RKGA and IA.
Place, publisher, year, edition, pages
2011. Vol. 2, no 6, 956-978 p.
Scheduling, Hybrid flow shop, Sequence-dependent setup times, Makespan, Meta-heuristic, Simulated annealing
Production Engineering, Human Work Science and Ergonomics
Research subject Industrial Engineering and Management
IdentifiersURN: urn:nbn:se:kth:diva-169412DOI: 10.1007%2Fs10845-009-0373-8ISI: 000296735800012ScopusID: 2-s2.0-84855493366OAI: oai:DiVA.org:kth-169412DiVA: diva2:820885
QC 201506232015-06-122015-06-122015-06-25Bibliographically approved