Rescheduling with New Orders Under Bounded Disruption

References

• Azizoglu M, Alagöz O (2005) Parallel-machine rescheduling with machine disruptions. IIE Trans. 37(12):1113–1118.Crossref, Google Scholar
• Boeckmann J, Thielen C, Pferschy U (2023) Approximating single- and multi-objective nonlinear sum and product knapsack problems. Discrete Optim. 48:100771.Crossref, Google Scholar
• Chen X, Miao Q, Lin BM, Sterna M, Blazewicz J (2022) Two-machine flow shop scheduling with a common due date to maximize total early work. Eur. J. Oper. Res. 300(2):504–511.Crossref, Google Scholar
• Fang K, Luo W, Pinedo ML, Jin M, Lu L (2024) Rescheduling for new orders on a single machine with rejection. J. Oper. Res. Soc. 75:346–360.Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco).Google Scholar
• Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals Discrete Math. 5:287–326.Crossref, Google Scholar
• Hall N, Potts C (2004) Rescheduling for new orders. Oper. Res. 52(3):440–453.Link, Google Scholar
• Hall N, Potts C (2010) Rescheduling for job unavailability. Oper. Res. 58(3):746–755.Link, Google Scholar
• Hall N, Liu Z, Potts C (2007) Rescheduling for multiple new orders. INFORMS J. Comput. 19(4):633–645.Link, Google Scholar
• Hoogeveen H, Lentè C, T’kindt V (2012) Rescheduling for new orders on a single machine with setup times. Eur. J. Oper. Res. 223:40–46.Crossref, Google Scholar
• Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems (Springer, Berlin).Crossref, Google Scholar
• Kellerer H, Mansini R, Pferschy U, Speranza MG (2003) An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. System Sci. 66(2):349–370.Crossref, Google Scholar
• Lee CY (1996) Machine scheduling with an availability constraint. J. Global Optim. 9:395–416.Crossref, Google Scholar
• Liu Z, Ro YK (2014) Rescheduling for machine disruption to minimize makespan and maximum lateness. J. Scheduling 17(4):339–352.Crossref, Google Scholar
• Liu Z, Lu L, Qi X (2018) Cost allocation in rescheduling with machine unavailable period. Eur. J. Oper. Res. 266(1):16–28.Crossref, Google Scholar
• Luo W, Jin M, Su B, Lin G (2020) An approximation scheme for rejection-allowed single-machine rescheduling. Comput. Industry Engrg. 146:106574.Crossref, Google Scholar
• Luo W, Luo T, Goebel R, Lin G (2018) Rescheduling due to machine disruption to minimize the total weighted completion time. J. Scheduling 21:565–578.Crossref, Google Scholar
• Moore JM (1968) Sequencing n jobs on one machine to minimize the number of tardy jobs. Management Sci. 15:102–109.Link, Google Scholar
• Nicosia G, Pacifici A, Pferschy U, Resch J, Righini G (2021) Optimally rescheduling jobs with a Last-In-First-Out buffer. J. Scheduling 24:663–680.Crossref, Google Scholar
• Pai CM, Liu YL, Hsu CJ (2014) Single-machine rescheduling of new orders with learning and deterioration effects consideration. Appl. Mechanical Materials 565:198–204.Crossref, Google Scholar
• Pferschy U, Resch J, Righini G (2023) Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs. J. Scheduling 26:267–287.Crossref, Google Scholar
• Pinedo ML (2012) Scheduling. Theory, Algorithms, and Systems, 4th ed. (Springer, Berlin).Crossref, Google Scholar
• Rener E, Salassa F, T’kindt V (2023) Single machine rescheduling for new orders: Properties and complexity results. Preprint, submitted July 27, https://arxiv.org/abs/2307.14876.Google Scholar
• Strusevich VA, Rustogi K (2016) Scheduling with flexible maintenance. Scheduling with Time-Changing Effects and Rate-Modifying Activities, vol. 243 of International Series in Operations Research and Management Science (Springer, Berlin), 291–315.Google Scholar
• Teghem J, Tuyttens D (2014) A bi-objective approach to reschedule new jobs in a one machine model. Internat. Trans. Oper. Res. 21:871–898.Crossref, Google Scholar
• Unal A, Uzsoy R, Kiran A (1997) Rescheduling on a single machine with part-type dependent setup times and deadlines. Ann. Oper. Res. 70:93–113.Crossref, Google Scholar
• Wang G, Sun H, Chu C (2005) Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann. Oper. Res. 133:183–192.Crossref, Google Scholar
• Wang D, Yin Y, Cheng T (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega 81:246–260.Crossref, Google Scholar
• Wang D, Yu Y, Qiu H, Yin Y, Cheng TCE (2020) Two-agent scheduling with linear resource-dependent processing times. Naval Res. Logist. 67(7):573–591.Crossref, Google Scholar
• Zhang X, Lin WC, Wu CC (2022) Rescheduling problems with allowing for the unexpected new jobs arrival. J. Combinatorial Optim. 43:630–645.Crossref, Google Scholar
• Zhao C, Tang H (2010) Rescheduling problems with deteriorating jobs under disruptions. Appl. Math. Modeling 34:238–243.Crossref, Google Scholar
• Zhao Q, Lu L, Yuan J (2016) Rescheduling with new orders and general maximum allowable time disruptions. 4OR 14:261–280.Google Scholar