Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times
- 136 Downloads
Industries such as textiles, paints, chemicals, paper, drugs and pharmaceuticals operate as flow shops with sequence-dependent setup times (SDST). The sequence-dependent setup environment is characterised by the dependence of the setup time on the current job and also on the previous job processed on that machine. To further complicate the problem, in most real-life scenarios, decision-makers have to optimise more than one performance measure while scheduling jobs on machines. This work considers such a multi-objective SDST flow shop environment. The objectives considered in the present study are minimisation of makespan and minimisation of mean tardiness. Four metaheuristics, viz. non-dominated sorting genetic algorithm (NSGA) II, hybrid NSGA II, discrete particle swarm optimisation and hybrid discrete particle swarm optimisation, belonging to the category of intelligent optimisation techniques, are developed to obtain a set of Pareto-optimal solutions. The proposed metaheuristics are applied on benchmark SDST flow shop problems and their performance compared using different measures. Analysis of the results reveals that hybrid NSGA II outperforms the other three algorithms for all problem sizes considered in the present research. The results also indicate that hybridisation of the metaheuristics with variable neighbourhood search improves their performance.
KeywordsPermutation flow shop Sequence-dependent setup time NSGA II Discrete particle swarm optimisation Variable neighbourhood search
The authors are most grateful to the reviewers, the associated editor and the editor-in-chief for their supportive and constructive comments.
- Bianco, L., Dell’Olmo, P., & Giordani, S. (1999). Flow shop no-wait scheduling with sequence dependent setup times and release dates. INFOR: Information Systems and Operational Research, 37(1), 3–19.Google Scholar
- Chaiyaratna, N., & Zalzala, A. (1999). Hybridisation of neural networks and genetic algorithms for time-optimal control. In Proceedings of the 1999 Congress on Evolutionary Computation - CEC99 (Vol. 1, pp. 389–396).Google Scholar
- Deb, K. (2005). Multi-objective optimisation using evolutionary algorithms (Student ed.). Hoboken: Wiley.Google Scholar
- Naderi, B., Zandieh, M., Balagh, A. K. G., & Roshanaei, V. (2009a). An improved simulated annealing for hybrid flow shops with sequence dependent setup and transportation times to minimise total completion times and total tardiness. Expert Systems with Applications, 36(6), 9625–9633.CrossRefGoogle Scholar
- Pan, Q., Tasgetiren, F., & Liang, Y. C. (2008). A discrete particle swarm optimisation algorithm for no-wait flow shop scheduling problem. European Journal of Operational Research, 35(9), 2807–2839.Google Scholar
- Peng, K., Wen, L., Li, R., Gao, L., & Li, X. (2018). An effective hybrid algorithm for permutation flow shop scheduling problem with setup time. In 51st CIRP conference on manufacturing systems, Procedia CIRP (Vol. 72, pp. 1288–1292).Google Scholar
- Rios-Mercado, R. Z., & Bard, J. F. (1999). A branch-and-bound algorithm for permutation flow shops with sequence dependent setup times. IIE Transactions, 31, 721–731.Google Scholar
- Sheikh, S., Komaki, M., Teymourian, E., & Malakooti, B. (2015). Multi-objective non-permutation flow shop with dependent setup times and missing operations. In Proceedings of the 2015 international conference on operations excellence and service engineering, Orlando, Florida, USA, September, 10–11.Google Scholar
- T’kindt, V., & Billaut, J. C. (2006). Multi-criteria scheduling: Theory, models and algorithms (2nd ed.). Berlin: Springer.Google Scholar