Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time

In this paper, we consider single-machine due window assignment and scheduling with a common flow allowance and controllable job processing times, subject to unlimited or limited resource availability. Due window assignment with a common flow allowance means that each job has a job-dependent due window, the starting time and completion time of which are equal to its actual processing time plus the job-independent parameters q1 and q2, respectively, which are common to all the jobs. The processing time of each job is either a linear or a convex function of the amount of a common continuously divisible resource allocated to the job. We study five versions of the problem that differ in terms of the objective function and processing time function being used. We provide structural properties of the optimal schedules and polynomial-time solution algorithms for the considered problems.

[1]  Raymond G. Vickson,et al.  Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .

[2]  Jacques Carlier,et al.  Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

[3]  T. C. Edwin Cheng,et al.  Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance , 2010, Comput. Oper. Res..

[4]  R. G. Vickson,et al.  Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..

[5]  S. S. Panwalkar,et al.  Single-machine sequencing with controllable processing times , 1992 .

[6]  T.C.E. Cheng,et al.  SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND EARLINESS, TARDINESS AND COMPLETION TIME PENALTIES , 1999 .

[7]  T.C.E. Cheng,et al.  Due-date assignment and single machine scheduling with compressible processing times , 1996 .

[8]  Costas P. Pappis,et al.  Single Machine Scheduling with Flow Allowances , 1996 .

[9]  P. De,et al.  Solving a generalized model for CON due date assignment and sequencing , 1994 .

[10]  Suh-Jenq Yang,et al.  Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance , 2012, Optim. Lett..

[11]  Bahram Alidaee.  Optimal assignment of slack due-date and sequencing in a single machine shop , 1991 .

[12]  Dvir Shabtay,et al.  Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine , 2007, Manuf. Serv. Oper. Manag..

[13]  Jean-Marie Proth,et al.  Scheduling with Due Date Assignment , 2004, Handbook of Scheduling.

[14]  T.C.E. Cheng.  Optimal slack due-date determination and sequencing , 1986 .

[15]  M. A. Quaddus.  A network flow approach to optimal slack due-date determination , 1990 .

[16]  Dirk Biskup,et al.  Common due date assignment for scheduling on a single machine with jointly reducible processing times , 2001 .

[17]  Suh-Jenq Yang,et al.  Single-Machine Scheduling with Due-Date Assignment and Aging Effect under a Deteriorating Maintenance Activity Consideration , 2010 .

[18]  Daniel Oron,et al.  Job-Dependent Due-Window Assignment Based On A Common Flow Allowance , 2010 .

[19]  Gur Mosheiov,et al.  Scheduling a maintenance activity and due-window assignment based on common flow allowance , 2012 .

[20]  T. Cheng.  Optimal assignment of slack due-dates and sequencing in a single-machine shop , 1989 .

[21]  Ji-Bo Wang.  Single machine common flow allowance scheduling with controllable processing times , 2006 .

[22]  R. Jackson.  Inequalities , 2007, Algebra for Parents.

[23]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[24]  Chengbin Chu,et al.  Due date assignment and scheduling: Slk, TWK and other due date assignment models , 2002 .

[25]  Suh-Jenq Yang,et al.  Single-Machine Scheduling with Due-Date Assignment and Aging Effect under a DeterioratingMaintenance Activity Consideration , 2010 .

[26]  Alexandre Dolgui,et al.  Scheduling with due date assignment under special conditions on job processing , 2012, J. Sched..

[27]  Dvir Shabtay,et al.  The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times , 2008, Ann. Oper. Res..

[28]  Eugeniusz Nowicki,et al.  A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..

[29]  Bahram Alidaee,et al.  Two parallel machine sequencing problems involving controllable job processing times , 1993 .

[30]  C. T. Ng,et al.  Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine , 2011 .

[31]  Radosław Rudek,et al.  On flowshop scheduling problems with the aging effect and resource allocation , 2012 .

[32]  V. S. Gordon.  A note on optimal assignment of slack due-dates in single-machine scheduling , 1993 .

[33]  Vitaly A. Strusevich,et al.  Single machine scheduling and due date assignment with positionally dependent processing times , 2009, Eur. J. Oper. Res..

[34]  T.C.E. Cheng.  Optimal constant due-date determination and sequencing of n jobs on a single machine , 1991 .

[35]  Radoslaw Rudek,et al.  A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models , 2011, Comput. Math. Appl..

[36]  Xiao-Yuan Wang,et al.  Single machine common flow allowance scheduling with a rate-modifying activity , 2010, Comput. Ind. Eng..

[37]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .