Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times

In this paper we consider the problem of single-machine batch delivery scheduling with an assignable common due date and controllable processing times. The job processing time is either a linear or a convex function of the amount of a continuously divisible and non-renewable resource allocated to the job. Finished jobs are delivered in batches and there is no capacity limit on each delivery batch. The objective is to find a job sequence, a partition of the job sequence into batches, a common due date, and resource allocation that jointly minimise a cost function based on earliness, weighted number of tardy jobs, job holding, due-date assignment, batch delivery, makespan, and resource consumption. We provide some properties of the optimal solution, and show that the problem with the linear and convex resource consumption functions can be solved in and time, respectively. We also show that some special cases of the problem can be solved by lower-order algorithms.

[1]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

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

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

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

[5]  K. R. Baker,et al.  A bicriterion approach to time/cost trade-offs in sequencing , 1982 .

[6]  Adam Janiak,et al.  One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints , 1987, Kybernetika.

[7]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[8]  Clyde L. Monma,et al.  Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..

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

[10]  Richard L. Daniels,et al.  A multi-objective approach to resource allocation in single machine scheduling , 1990 .

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

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

[13]  Chung Yee Lee,et al.  On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date , 1993 .

[14]  T.C.E. Cheng,et al.  Resource optimal control in some single-machine scheduling problems , 1994, IEEE Trans. Autom. Control..

[15]  A. Janiak,et al.  Job-shop scheduling with convex models of operations , 1994 .

[16]  C. Scott,et al.  Allocation of resources in project management , 1995 .

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

[18]  Chung-Lun Li,et al.  Single-machine scheduling with trade-off between number of tardy jobs and resource allocation , 1996, Oper. Res. Lett..

[19]  Adam Janiak,et al.  Single machine scheduling subject to deadlines and resource dependent processing times , 1996 .

[20]  Lei Lei,et al.  Solving a class of two-resource allocation problem by equivalent load method , 1997 .

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

[22]  Chung-Yee Lee,et al.  Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases , 2001, Ann. Oper. Res..

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

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

[25]  Dvir Shabtay,et al.  Minimizing the total weighted flow time in a single machine with controllable processing times , 2004, Comput. Oper. Res..

[26]  T. C. Edwin Cheng,et al.  Single machine batch scheduling with jointly compressible setup and processing times , 2004, Eur. J. Oper. Res..

[27]  Frank Werner,et al.  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..

[28]  Dvir Shabtay,et al.  Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine , 2004, Comput. Oper. Res..

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

[30]  Dvir Shabtay,et al.  A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates , 2006, Comput. Oper. Res..

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

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

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

[34]  Yakup Atasagun,et al.  Balancing straight and U-shaped assembly lines with resource dependent task times , 2011 .

[35]  H. Mokhtari,et al.  A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources , 2011 .

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

[37]  T. C. Edwin Cheng,et al.  Single-machine batch delivery scheduling with an assignable common due date and controllable processing times , 2013, Comput. Ind. Eng..

[38]  A. Kvaratskhelia,et al.  Scheduling Problem , 2020 .