Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness
- 428 Downloads
This article addresses the problem of scheduling hybrid flowshops where the setup times are sequence dependent to minimize makespan and maximum tardiness. To solve such an NP-hard problem, we introduce a novel simulated annealing (SA) with a new concept, called “Migration mechanism”, and a new operator, called “Giant leap”, to bolster the competitive performance of SA through striking a compromise between the lengths of neighborhood search structures. We hybridize the SA (HSA) with a simple local search to further equip our algorithm with a new strong tool to promote the quality of final solution of our proposed SA. We employ the Taguchi method as an optimization technique to extensively tune different parameters and operators of our algorithm. Taguchi orthogonal array analysis is specifically used to pick the best parameters for the optimum design process with the least number of experiments. We established a benchmark to draw an analogy between the performance of SA with other algorithms. Two basically different objective functions, minimization of makespan and maximum tardiness, are taken into consideration to evaluate the robustness and effectiveness of the proposed HSA. Furthermore, we explore the effects of the increase in the number of jobs on the performance of our algorithm to make sure it is effective in terms of both the acceptability of the solution quality and robustness. The excellence and strength of our HSA are concluded from all the results acquired in various circumstances.
KeywordsScheduling Hybrid flowshops Sequence dependent setup time Makespan Maximum tardiness Simulated annealing Local search Taguchi method
Unable to display preview. Download preview PDF.
- 2.Baker KR (1974) Introduction to sequence and scheduling. Wiley, New YorkGoogle Scholar
- 9.Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2007) Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol, doi: 10.1007/s00170-007-0977-0
- 16.Yoshida T, Hitomi K (1979) Optimal two-stage production with setup times separated. AIIE Trans 11:261–263Google Scholar
- 23.Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, Upper Saddle RiverGoogle Scholar
- 26.Norman BA, Bean JC (1999) A genetic algorithm methodology for complex scheduling problems. Nav Res Logist 46:199–211, doi: 10.1002/(SICI)1520-6750(199903)46:2<199::AID-NAV5>3.0.CO;2-L zbMATHCrossRefMathSciNetGoogle Scholar
- 28.Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New YorkGoogle Scholar
- 32.Ross RJ (1989) Taguchi techniques for quality engineering. McGraw-Hill, New YorkGoogle Scholar