Approximate and robust bounded job start scheduling for Royal Mail delivery offices
type: Item
instance of: scholarly article
title: Approximate and robust bounded job start scheduling for Royal Mail delivery offices
zbMATH Open document ID: 1479.90100
author: Dimitrios Letsios
author: Jeremy T. Bradley
author: Suraj G.
author: Ruth Misener
author: Natasha Page
published in: Journal of Scheduling
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7443462
zbMATH Keywords: bounded job start scheduling
zbMATH Keywords: approximation algorithms
zbMATH Keywords: robust scheduling
zbMATH Keywords: mail deliveries
MaRDI profile type: Publication
full work available at URL: s10951-021-00678-7
OpenAlex ID: W3139395973
cites work: Q3182207
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: Theory and Applications of Robust Optimization
cites work: Finite Adaptability in Multistage Linear Optimization
cites work: The Price of Robustness
cites work: Single machine scheduling with forbidden start times
cites work: Algorithms and uncertainty sets for data-driven robust shortest path problems
cites work: A survey of hard real-time scheduling for multiprocessor systems
cites work: Vehicle Routing with Time Windows: Two Optimization Algorithms
cites work: High-multiplicity scheduling on one machine with forbidden start and completion times
cites work: Q4198056
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: K-Adaptability in Two-Stage Robust Binary Programming
cites work: Speed is as powerful as clairvoyance
cites work: Interval scheduling: A survey
cites work: Exact lexicographic scheduling and approximate rescheduling
cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
cites work: Parameterized complexity of machine scheduling: 15 open problems
cites work: Optimal time-critical scheduling via resource augmentation
cites work: A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
cites work: Scheduling with forbidden sets
cites work: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
cites work: Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
cites work: Hardness of Precedence Constrained Scheduling on Identical Machines
DOI: 10.1007/S10951-021-00678-7
description: scientific article; zbMATH DE number 7443462