Permutation flow shop scheduling with earliness and tardiness penalties

We consider the permutation flow shop scheduling problem with earliness and tardiness penalties (E/T) and common due date for jobs. We show that the problem can be sub-divided into three cases: (i) the due date is such that all jobs are necessarily tardy; (ii) the due date is unrestricted; and (iii) the due date is between the two. Based on analytical results we provide partial characterisation of the optimal solution and develop a comprehensive approach for solving the problem over the entire range of due dates. Our approach, which draws upon the existing literature and results for the single machine problem, successfully exploits the properties of the optimal solution. Limited computational results indicate that the performance of the heuristic is reasonable and has the potential to significantly improve performance. This approach has been incorporated as part of the scheduling module of the production planning and scheduling system we developed for a medium-sized bulk drug manufacturer.

[1]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[2]  P. Simin Pulat,et al.  The shifting bottleneck procedure for job-shops with parallel machines , 2006 .

[3]  Chandrasekharan Rajendran,et al.  Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date , 2001, Eur. J. Oper. Res..

[4]  Jatinder N. D. Gupta,et al.  Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..

[5]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

[6]  V. Sridharan,et al.  Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review , 2000, Oper. Res..

[7]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

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

[10]  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..

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

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

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

[14]  S. Lakshminarayan,et al.  Technical Note - Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1978, Oper. Res..

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

[16]  Jeffrey B. Sidney,et al.  Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

[17]  Martin Feldmann,et al.  On scheduling around large restrictive common due windows , 2005, Eur. J. Oper. Res..

[18]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

[19]  R. Ahmadi,et al.  Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop , 1990 .

[20]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[21]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[22]  M. Raghavachari.  A V-shape property of optimal schedule of jobs about a common due date , 1986 .

[23]  Vinícius Amaral Armentano,et al.  A heuristic for single machine scheduling with early and tardy costs , 2001, Eur. J. Oper. Res..

[24]  H. G. Kahlbacher,et al.  A proof for the longest‐job‐first policy in one‐machine scheduling , 1991 .

[25]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[26]  Mesbah U. Ahmed,et al.  Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .

[27]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

[28]  Reha Uzsoy,et al.  Performance of decomposition procedures for job shop scheduling problems with bottleneck machines , 2000 .

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

[30]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[31]  C. Chu,et al.  Some new efficient methods to solve the n/1/ri/ϵTi scheduling problem , 1992 .

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

[33]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[34]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[35]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .