Two-machine flowshop scheduling with idle insert to minimize the sum of maximum earliness, tardiness and completion time

This paper considers a new mathematical model for a two-machine flowshop scheduling problem with idle insert and sequence-dependant set up time in order to fmd a more realisticcondition. The aim of this model is to minimize the sum of maximum earliness and tardiness and to minimize the maximumcompletion time (makespan or Cmax)· To show the validity of the model, a number of test problems are solved and the associatedresults are reported

Keywords:

Flowshop scheduling , idle insert , maximum earliness and tardiness , makespan