Two-agent single-machine scheduling with assignable due dates

Abstract We consider several two-agent scheduling problems with assignable due dates on a single machine, where each of the agents wants to minimize a measure depending on the completion times of its own jobs and the due dates are treated as given variables and must be assigned to individual jobs. The goal is to assign a due date from a given set of due dates and a position in the sequence to each job so that the weighted sum of the objectives of both agents is minimized. For different combinations of the objectives, which include the maximum lateness, total (weighted) tardiness, and total (weighted) number of tardy jobs, we provide the complexity results and solve the corresponding problems, if possible.

[1]  Alessandro Agnetis,et al.  Multi-agent single machine scheduling , 2007, Ann. Oper. Res..

[2]  Gerd Finke,et al.  Scheduling with common due date assignment , 2001, ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597).

[3]  Chelliah Sriskandarajah.  A Note on the Generalized Due Dates Scheduling Problems , 1988 .

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

[5]  T.C.E. Cheng,et al.  Two-agent single-machine scheduling with release times and deadlines , 2013 .

[6]  T. C. Edwin Cheng,et al.  Two-agent scheduling with position-based deteriorating jobs and learning effects , 2011, Appl. Math. Comput..

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

[8]  Xiangtong Qi,et al.  Single machine scheduling with assignable due dates , 2002, Discret. Appl. Math..

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

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

[11]  P. Liu,et al.  Two-agent single-machine scheduling problems under increasing linear deterioration , 2011 .

[12]  T. C. Edwin Cheng,et al.  A note on the complexity of the problem of two-agent scheduling on a single machine , 2006, J. Comb. Optim..

[13]  Jonathan Cole Smith,et al.  A Multiple-Criterion Model for Machine Scheduling , 2003, J. Sched..

[14]  Alessandro Agnetis,et al.  A Lagrangian approach to single-machine scheduling problems with two competing agents , 2009, J. Sched..

[15]  Lixin Tang,et al.  Two-agent group scheduling with deteriorating jobs on a single machine , 2010 .

[16]  Ji-Bo Wang,et al.  A due-date assignment problem with learning effect and deteriorating jobs , 2010 .

[17]  Suh-Jenq Yang.  Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration , 2010, Appl. Math. Comput..

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

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

[20]  T. C. Edwin Cheng,et al.  Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs , 2006, Theor. Comput. Sci..

[21]  Keisuke Tanaka,et al.  Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine , 1999, Ann. Oper. Res..

[22]  Nicholas G. Hall.  Scheduling Problems With Generalized Due Dates , 1986 .

[23]  Gang Li,et al.  Optimal due-date assignment problem with learning effect and resource-dependent processing times , 2014, Optim. Lett..

[24]  Dvir Shabtay,et al.  Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs , 2010 .

[25]  Milan Vlach,et al.  Single Machine Scheduling to Minimize the Maximum Lateness with Both Specific and Generalized Due Dates (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems) , 1997 .

[26]  Chin-Chia Wu,et al.  Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties , 2012, Inf. Sci..

[27]  Daniel Oron,et al.  Due-date assignment and maintenance activity scheduling problem , 2006, Math. Comput. Model..

[28]  Suh-Jenq Yang,et al.  Two due date assignment problems with position-dependent processing time on a single-machine , 2011, Comput. Ind. Eng..

[29]  Suh-Jenq Yang,et al.  Multi-machine scheduling with deterioration effects and maintenance activities for minimizing the total earliness and tardiness costs , 2013 .

[30]  Ji-Bo Wang,et al.  Single machine multiple common due dates scheduling with learning effects , 2010, Comput. Math. Appl..

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

[32]  Gur Mosheiov,et al.  Single machine batch scheduling with two competing agents to minimize total flowtime , 2011, Eur. J. Oper. Res..

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

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

[35]  Weiping Shang,et al.  A note on the scheduling with two families of jobs , 2005, J. Sched..

[36]  T. C. Edwin Cheng,et al.  Multi-agent scheduling on a single machine with max-form criteria , 2008, Eur. J. Oper. Res..

[37]  Byung-Cheon Choi,et al.  Approximation algorithms for multi-agent scheduling to minimize total weighted completion time , 2009, Inf. Process. Lett..

[38]  Ji-Bo Wang,et al.  Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties , 2011, Appl. Math. Comput..

[39]  Milan Vlach,et al.  Single Machine Scheduling to Minimize the Maximum Lateness with Both Specific and Generalized Due Dates , 1997 .

[40]  Radoslaw Rudek.  The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect , 2012, Appl. Math. Comput..

[41]  Gur Mosheiov,et al.  Scheduling problems with two competing agents to minimize minmax and minsum earliness measures , 2010, Eur. J. Oper. Res..

[42]  Joseph Y.-T. Leung,et al.  Scheduling two agents with controllable processing times , 2010, Eur. J. Oper. Res..

[43]  T. C. Edwin Cheng,et al.  A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations , 2011, Comput. Ind. Eng..