Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule for a given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs.

[1]  Francis Sourd,et al.  Scheduling with convex cost functions , 2000 .

[2]  Martin Feldmann,et al.  Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates , 2001, Comput. Oper. Res..

[3]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[4]  J. I. Min,et al.  Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date , 2001, Eur. J. Oper. Res..

[5]  Frank Werner,et al.  On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties , 2004, Comput. Oper. Res..

[6]  Francis Sourd,et al.  An improved earliness-tardiness timing algorithm , 2007, Comput. Oper. Res..

[7]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[8]  T. C. Edwin Cheng,et al.  Two-stage flowshop earliness and tardiness machine scheduling involving a common due window , 2004 .

[9]  Francis Sourd,et al.  PERT scheduling with convex cost functions , 2003, Theor. Comput. Sci..

[10]  Jatinder N. D. Gupta,et al.  Comparative evaluation of MILP flowshop models , 2005, J. Oper. Res. Soc..

[11]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

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

[13]  Yih-Long Chang,et al.  MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

[14]  Martin Feldmann,et al.  Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .

[15]  Tapan Sen,et al.  A state-of-art survey of static scheduling research involving due dates , 1984 .

[16]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

[17]  Hüseyin Sarper,et al.  Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem , 1995 .

[18]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[19]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[20]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[21]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[22]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[23]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[24]  Shuo-Yan Chou,et al.  A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date , 2007, Eur. J. Oper. Res..