Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

¹ Mechanical Engineering Department, Faculty of Engineering & Technology, I.K. Gujral Punjab Technical University, Jalandhar (Kapurthala), Punjab 144603, India
² Mechanical Engineering Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib, Punjab 140407, India

^* Corresponding author: harpreet.mech9@gmail.com

Received: 17 August 2019
Accepted: 19 May 2020

Abstract

Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows the changes in the job order to flexibly manage such irregularity. The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries. The scope of this paper is to identify the literature available on permutation and non-permutation flow shop scheduling with no-wait constraint. This paper organizes scheduling problems based on performance measures of variability and shop environments. The extended summary of two/three-machine and m-machine problems has been compiled, including their objectives, algorithms, parametric considerations, and their findings. A systematic appearance of both conceptual and analytical results summarizes various advances of the no-wait constraint. The paper includes independently investigated problems and suggestions for future research directions.