Due-window assignment with identical jobs on parallel uniform machines

A scheduling problem with a common due-window, earliness and tardiness costs, and identical processing time jobs is studied. We focus on the setting of both (i) job-dependent earliness/tardiness job weights and (ii) parallel uniform machines. The objective is to find the job allocation to the machines and the job schedule, such that the total weighted earliness and tardiness cost is minimized. We study both cases of a non-restrictive (i.e. sufficiently late), and a restrictive due-window. For a given number of machines, the solutions of the problems studied here are obtained in polynomial time in the number of jobs.

[1]  Frank Werner,et al.  Parallel machine problems with equal processing times: a survey , 2011, J. Sched..

[2]  T. C. Edwin Cheng,et al.  Single-machine scheduling with a common due window , 2001, Comput. Oper. Res..

[3]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[4]  Philippe Baptiste,et al.  Scheduling Equal Processing Time Jobs , 2004, Handbook of Scheduling.

[5]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[6]  Gur Mosheiov,et al.  Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs , 2006, Eur. J. Oper. Res..

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

[8]  Chung Yee Lee,et al.  COMMON DUE‐WINDOW SCHEDULING , 1993 .

[9]  Gur Mosheiov,et al.  Due-date assignment on uniform machines , 2009, Eur. J. Oper. Res..

[10]  C.-L. Yang,et al.  Parallel machine scheduling with common due windows , 2010, J. Oper. Res. Soc..

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

[12]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[13]  Adam Janiak,et al.  Soft Due Window Assignment and Scheduling on Parallel Machines , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[14]  Adam Janiak,et al.  Soft due window assignment and scheduling of unit-time jobs on parallel machines , 2012, 4OR.

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

[16]  Ceyda Oguz,et al.  Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs , 2009 .

[17]  Ameur Soukhal,et al.  Due dates assignment and JIT scheduling with equal-size jobs , 2010, Eur. J. Oper. Res..

[18]  Gur Mosheiov,et al.  Minmax scheduling problems with a common due-window , 2009, Comput. Oper. Res..

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

[20]  Adam Janiak,et al.  A Single Processor Scheduling Problem with a Common Due Window Assignment , 2004, OR.

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

[22]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

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

[24]  Ameur Soukhal,et al.  Some new polynomial cases in just-in-time scheduling problems with multiple due dates , 2008, 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies.

[25]  Gur Mosheiov,et al.  Due-window assignment problems with unit-time jobs , 2013, Appl. Math. Comput..