Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect

This paper addresses single-machine scheduling problem with resource allocation and learning effect in the background of past-sequence-dependent (p-s-d) setup times. In the proposed model of this paper, the actual job processing times are dependent on learning effect and the amount of resource allocated, and the setup times are proportional to the length of the already processed jobs. The resource function used here is a general convex one. The optimal job sequence and the optimal amount of resource allocated to each job are determined jointly for the objective function yielded by a combination of the total completion time, total absolute differences in completion times, and the total resource consumption. Besides, we also discuss some extension and special cases of this problem. It is shown that all the problems under study are polynomially solvable while the complexity results are different.

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

[2]  Valery S. Gordon,et al.  A note: Common due date assignment for a single machine scheduling with the rate-modifying activity , 2009, Comput. Oper. Res..

[3]  Ji-Bo Wang,et al.  Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times , 2009, Comput. Math. Appl..

[4]  Christopher D. Geiger,et al.  A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration , 2010, Eur. J. Oper. Res..

[5]  Uttarayan Bagchi,et al.  Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems , 1989, Oper. Res..

[6]  Dirk Biskup,et al.  Single-machine scheduling with learning considerations , 1999, Eur. J. Oper. Res..

[7]  Heng-Yong Tang,et al.  Two-parallel machines scheduling with rate-modifying activities to minimize total completion time , 2009, Eur. J. Oper. Res..

[8]  Chuanli Zhao,et al.  Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs , 2010, Comput. Ind. Eng..

[9]  Rakesh K. Sarin,et al.  Technical Note - Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy , 1989, Oper. Res..

[10]  Ming Liu,et al.  Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity , 2013 .

[11]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[12]  Christos Koulamas.  A note on single-machine scheduling with job-dependent learning effects , 2010, Eur. J. Oper. Res..

[13]  Dar-Li Yang,et al.  Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect , 2006, Eur. J. Oper. Res..

[14]  Christos Koulamas,et al.  Single-machine scheduling problems with past-sequence-dependent setup times , 2008, Eur. J. Oper. Res..

[15]  Dan Wang,et al.  Single-machine scheduling with learning effect and resource-dependent processing times , 2010, Comput. Ind. Eng..

[16]  G. Steiner,et al.  The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times , 2007 .

[17]  Joseph Y.-T. Leung,et al.  Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..

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

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

[20]  Feng Chu,et al.  Scheduling with resource allocation and past-sequence-dependent setup times including maintenance , 2011, 2011 International Conference on Networking, Sensing and Control.

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

[22]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[23]  T. C. Edwin Cheng,et al.  Single machine batch scheduling with resource dependent setup and processing times , 2001, Eur. J. Oper. Res..

[24]  Dvir Shabtay,et al.  A unified approach for scheduling with convex resource consumption functions using positional penalties , 2010, Eur. J. Oper. Res..

[25]  T. C. Edwin Cheng,et al.  Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties , 2004, J. Sched..

[26]  T. C. Edwin Cheng,et al.  NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time , 2007, Eur. J. Oper. Res..

[27]  T.C.E. Cheng,et al.  Single machine scheduling with a restricted rate‐modifying activity , 2005 .

[28]  Daniel Oron,et al.  Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times , 2008, Comput. Oper. Res..

[29]  Guoqing Wang,et al.  Single Machine Scheduling with Learning Effect Considerations , 2000, Ann. Oper. Res..

[30]  Ji-Bo Wang,et al.  Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect , 2008, Comput. Ind. Eng..

[31]  Chin-Chia Wu,et al.  Minimizing total completion time in a two-machine flowshop with a learning effect , 2004 .

[32]  Ji-Bo Wang,et al.  Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects , 2011 .

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

[34]  Christos Koulamas,et al.  Single-machine and two-machine flowshop scheduling with general learning functions , 2007, Eur. J. Oper. Res..

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

[36]  Vitaly A. Strusevich,et al.  Planning Machine Maintenance in Two-Machine Shop Scheduling , 2006, Oper. Res..

[37]  Dirk Biskup,et al.  Single-machine scheduling against due dates with past-sequence-dependent setup times , 2008, Eur. J. Oper. Res..

[38]  Gur Mosheiov,et al.  Scheduling a deteriorating maintenance activity on a single machine , 2010, J. Oper. Res. Soc..

[39]  Gur Mosheiov,et al.  Scheduling with general job-dependent learning curves , 2003, Eur. J. Oper. Res..

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

[41]  Nigel Slack,et al.  Operations management , 1994 .

[42]  M. Asano,et al.  Scheduling with shutdowns and sequence dependent set-up times , 1999 .

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

[44]  Suh-Jenq Yang,et al.  Computers and Mathematics with Applications Minimizing the Total Completion Time in Single-machine Scheduling with Aging/deteriorating Effects and Deteriorating Maintenance Activities , 2022 .

[45]  Feng Chu,et al.  Single-machine group scheduling with resource allocation and learning effect , 2011, Comput. Ind. Eng..

[46]  T.C.E. Cheng,et al.  Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times , 2013 .

[47]  Dirk Biskup,et al.  A state-of-the-art review on scheduling with learning effects , 2008, Eur. J. Oper. Res..

[48]  Dvir Shabtay,et al.  Convex resource allocation for minimizing the makespan in a single machine with job release dates , 2004, Comput. Oper. Res..

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

[50]  T.C.E. Cheng,et al.  Scheduling problems with deteriorating jobs and learning effects including proportional setup times , 2010, Comput. Ind. Eng..