Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
DOI10.1007/s10951-022-00751-9zbMath1518.90032OpenAlexW4303457317MaRDI QIDQ6116027
Julia Resch, Ulrich Pferschy, Giovanni Righini
Publication date: 13 July 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-022-00751-9
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Algorithms for the car sequencing and the level scheduling problem
- Distributionally robust single machine scheduling with the total tardiness criterion
- Robust single machine scheduling with a flexible maintenance activity
- Optimally rescheduling jobs with a last-in-first-out buffer
- Single machine rescheduling for new orders with maximum lateness minimization
- Rescheduling under disruptions in manufacturing systems. Models and algorithms
- Rescheduling production and outbound deliveries when transportation service is disrupted
- A survey of dynamic scheduling in manufacturing systems
- Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients
- Supply chain scheduling: sequence coordination
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- Rescheduling for Multiple New Orders
- Rescheduling for Job Unavailability
- Rescheduling for New Orders
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Rescheduling job shops under random disruptions
This page was built for publication: Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
