A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times

  • Authors:

  • H. S. Mirsanei;M. Zandieh;M. J. Moayed;M. R. Khabbazi

  • Affiliations:

  • Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, Tehran, Iran;Department of Computer Science and Information Technology, University Putra Malaysia, Serdang, Malaysia;Department of Mechanical and Manufacturing Engineering, University Putra Malaysia, Serdang, Malaysia

  • Venue:
  • Journal of Intelligent Manufacturing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.