Approximate and robust bounded job start scheduling for Royal Mail delivery offices

DOI10.1007/s10951-021-00678-7zbMath1479.90100OpenAlexW3139395973MaRDI QIDQ2061143

Ruth Misener, Jeremy T. Bradley, Dimitrios Letsios, Natasha Page, Suraj G.

Publication date: 13 December 2021

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

Full work available at URL: https://doi.org/10.1007/s10951-021-00678-7

zbMATH Keywords

approximation algorithmsrobust schedulingbounded job start schedulingmail deliveries

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• High-multiplicity scheduling on one machine with forbidden start and completion times
• Single machine scheduling with forbidden start times
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Adjustable robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• Algorithms and uncertainty sets for data-driven robust shortest path problems
• Parameterized complexity of machine scheduling: 15 open problems
• A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
• Exact lexicographic scheduling and approximate rescheduling
• A survey of hard real-time scheduling for multiprocessor systems
• Theory and Applications of Robust Optimization
• Hardness of Precedence Constrained Scheduling on Identical Machines
• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
• K-Adaptability in Two-Stage Robust Binary Programming
• Interval scheduling: A survey
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Vehicle Routing with Time Windows: Two Optimization Algorithms
• Speed is as powerful as clairvoyance
• Finite Adaptability in Multistage Linear Optimization
• Bounds on Multiprocessing Timing Anomalies
• Optimal time-critical scheduling via resource augmentation
• Scheduling with forbidden sets

This page was built for publication: Approximate and robust bounded job start scheduling for Royal Mail delivery offices