No-Wait Flowshop Scheduling Problem with Bicriteria of Idle Time and Makespan

Flowshop scheduling problem with bicriteria of makespan and idle time under no-wait constraint is addressed in this paper. The problem of flowshop scheduling environment with criteria of minimum makespan and idle time is NP-hard under no-wait constraint; therefore, heuristic algorithms are key to obtain the solutions of these problems near to optimal. The paper describes a heuristic technique to schedule the sequence of n jobs on m machine in no-wait flowshop environment with objective of minimizing both makespan and idle time. Computation results show the better solution quality of proposed heuristic approach over existing constructive heuristics.