An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines

We consider the ordinary NP- hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. We present an O(n2) algorithm for the problem when the machines are ordered, that is, when each job has its smaller processing time on the first (second) machine. We also discuss the applicability of the proposed algorithm to the corresponding single-objective problem in which the common due date is given.

[1]  David R. Karger,et al.  Techniques for scheduling with rejection , 2003, J. Algorithms.

[2]  Jatinder N. D. Gupta,et al.  Minimizing tardy jobs in a flowshop with common due date , 2000, Eur. J. Oper. Res..

[3]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[4]  S. S. Panwalkar,et al.  An ordered flow-shop sequencing problem with mean completion time criterion† , 1976 .

[5]  Han Hoogeveen,et al.  The three-machine proportionate flow shop problem with unequal machine speeds , 2003, Oper. Res. Lett..

[6]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[7]  Federico Della Croce,et al.  A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem , 2011, EvoCOP.

[8]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling , 2018 .

[9]  Federico Della Croce,et al.  Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria , 2007, INFORMS J. Comput..

[10]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[11]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[12]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

[13]  R. K. Arora,et al.  Scheduling in a Semi-Ordered Flow-shop Without Intermediate Queues , 1980 .

[14]  Wieslaw Kubiak,et al.  Scheduling shops to minimize the weighted number of late jobs , 1994, Oper. Res. Lett..

[15]  Rubén Ruiz,et al.  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..

[16]  Jatinder N. D. Gupta,et al.  Two-machine flowshop scheduling to minimize the number of tardy jobs , 1997 .

[17]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

[18]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.