Optimally rescheduling jobs with a last-in-first-out buffer

DOI10.1007/S10951-021-00707-5zbMath1480.90137arXiv2106.15901OpenAlexW3201288902MaRDI QIDQ2066687

Julia Resch, Giovanni Righini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy

Publication date: 14 January 2022

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.15901

zbMATH Keywords

complexityschedulingreschedulingsupply chain sustainabilitydynamic programming algorithmssequence coordination

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs

Cites Work

• One-machine rescheduling heuristics with efficiency and stability as criteria
• Set-up coordination between two stages of a supply chain
• Distributionally robust single machine scheduling with the total tardiness criterion
• Price of fairness in two-agent single-machine scheduling problems
• Robust single machine scheduling with a flexible maintenance activity
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• 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
• Competitive Two-Agent Scheduling and Its Applications
• 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
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

This page was built for publication: Optimally rescheduling jobs with a last-in-first-out buffer