Single-machine scheduling with common due-window assignment for deteriorating jobs

In this paper, we consider a single-machine common due-window assignment scheduling problem with deteriorating jobs. Jobs’ processing times are defined by function of their starting times and job-dependent deterioration rates that are related to jobs and are not all equal. The objective is to determine an optimal combination of sequence and common due-window location so as to minimize the weighted sum of earliness, tardiness and due-window location penalties. We propose an O(n2 log n) time algorithm to solve the problem and discuss several instances to illustrate it.

[1]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[2]  Dar-Li Yang,et al.  A note on due-date assignment and single-machine scheduling with deteriorating jobs , 2008, J. Oper. Res. Soc..

[3]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[4]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

[5]  Min Xiao.  Just-in-time on single machine scheduling problem with deteriorating jobs , 2010 .

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

[7]  T. C. Edwin Cheng,et al.  Some scheduling problems with deteriorating jobs and learning effects , 2008, Comput. Ind. Eng..

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

[9]  Gur Mosheiov,et al.  A due-window assignment problem with position-dependent processing times , 2008, J. Oper. Res. Soc..

[10]  Surya D. Liman,et al.  Common due window size and location determination in a single machine scheduling problem , 1998, J. Oper. Res. Soc..

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

[12]  Dar-Li Yang,et al.  A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects , 2011, J. Oper. Res. Soc..

[13]  Daniel Oron,et al.  Due‐window assignment with unit processing‐time jobs , 2004 .

[14]  S. S. Panwalkar,et al.  Determination of common due window location in a single machine scheduling problem , 1996 .

[15]  J. A. Ventura,et al.  Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times , 1994 .

[16]  Michael X. Weng,et al.  A NOTE ON “COMMON DUE WINDOW SCHEDULING” , 2009 .

[17]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[18]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

[19]  T. C. Edwin Cheng,et al.  Due-date assignment and single machine scheduling with deteriorating jobs , 2004, J. Oper. Res. Soc..