Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

The just-in-time production philosophy has led to a growing interest in schedulingproblems considering both earliness and tardiness penalties. Most publications considering these so-called nonregular objective functions are devoted to single machine problems. In the case of multimachine problems, there are some papers dealing with parallel machine problems. However, for multi-operation scheduling problems such as shop scheduling problems, investigations have begun only recently. In this paper, inspired by recent own work (partly yet unpublished), we survey some results on multimachine scheduling problems with a given common due date, where the focus is on possible approaches for shop scheduling problems.

[1]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties , 1989 .

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

[3]  Nicholas G. Hall Single- and multiple-processor models for minimizing completion time variance , 1986 .

[4]  S. Sethi,et al.  Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems , 1990 .

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

[6]  S. T. Webster,et al.  The complexity of scheduling job families about a common due date , 1997, Oper. Res. Lett..

[7]  Yih-Long Chang,et al.  Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date , 1987 .

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

[9]  Frank Werner,et al.  Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties , 2001 .

[10]  Hamilton Emmons,et al.  Scheduling to a common due date on parallel uniform processors , 1987 .

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

[12]  D. Preßmar,et al.  Operations research proceedings , 1990 .

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

[14]  Jatinder N. D. Gupta,et al.  On the Solution of 2-Machine Flow Shop Problems With a Common Due Date , 2000 .

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

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

[17]  Jose A. Ventura,et al.  An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date , 1995, Oper. Res. Lett..

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

[19]  Guoqing Wang,et al.  Parallel machine earliness and tardiness scheduling with proportional weights , 2003, Comput. Oper. Res..

[20]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[21]  A. Federgruen,et al.  Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs , 1997 .

[22]  Gur Mosheiov,et al.  Minmax earliness-tardiness costs with unit processing time jobs , 2001, Eur. J. Oper. Res..

[23]  Gur Mosheiov,et al.  Heuristics for multimachine scheduling problems with earliness and tardiness costs , 1996 .

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

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