Single-machine scheduling with positional due indices and positional deadlines

Abstract In this paper, we study single-machine scheduling problems with due dates, positional due indices, deadlines and positional deadlines. The scheduling criteria studied in this paper include the number of position-violated tasks, the weighted number of position-violated tasks, and the maximum positional lateness of tasks, by also combining with other traditional scheduling criteria. For each problem, we either provide a polynomial-time algorithm or present an NP-hardness proof.

[1]  R. Gomory,et al.  A Primal Method for the Assignment and Transportation Problems , 1964 .

[2]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[3]  Allan Larsen,et al.  Disruption management - operations research between planning and execution , 2001 .

[4]  Jinjiang Yuan,et al.  Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices , 2020, 4OR.

[5]  Jinjiang Yuan,et al.  A note on the single machine scheduling to minimize the number of tardy jobs with deadlines , 2010, Eur. J. Oper. Res..

[6]  Erik Demeulemeester,et al.  Operating room planning and scheduling: A literature review , 2010, Eur. J. Oper. Res..

[7]  Jinjiang Yuan,et al.  Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints , 2017, Discret. Optim..

[8]  James C. Bean,et al.  Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Robert L. Bulfin,et al.  Scheduling unit processing time jobs on a single machine with multiple criteria , 1990, Comput. Oper. Res..

[11]  Jinjiang Yuan,et al.  Rescheduling with new orders and general maximum allowable time disruptions , 2016, 4OR.

[12]  Dario Pacciarelli,et al.  Optimal inter-area coordination of train rescheduling decisions , 2011 .

[13]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[14]  Xiaoning Zhu,et al.  A practical model for last train rescheduling with train delay in urban railway transit networks , 2015 .

[15]  Jinjiang Yuan.  Unary NP-hardness of minimizing the number of tardy jobs with deadlines , 2017, J. Sched..

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

[17]  Joseph Y.-T. Leung,et al.  Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness , 2007, Eur. J. Oper. Res..

[18]  Z. Przasnyski.  Operating room scheduling. A literature review. , 1986, AORN journal.

[20]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[21]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[22]  Jinjiang Yuan,et al.  Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs , 2017, Asia Pac. J. Oper. Res..

[23]  Jing Shi,et al.  Rescheduling of elective patients upon the arrival of emergency patients , 2012, Decis. Support Syst..