Approximate and robust bounded job start scheduling for Royal Mail delivery offices
Year of publication: |
2021
|
---|---|
Authors: | Letsios, Dimitrios ; Bradley, Jeremy T. ; Suraj G ; Misener, Ruth ; Page, Natasha |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 2, p. 237-258
|
Subject: | Bounded job start scheduling | Approximation algorithms | Robust scheduling | Mail deliveries | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Postsektor | Postal sector |
-
Risk-averse single machine scheduling : complexity and approximation
Kasperski, Adam, (2019)
-
Single machine robust scheduling with budgeted uncertainty
Bougeret, Marin, (2023)
-
An adaptive robust optimization model for parallel machine scheduling
Cohen, Izack, (2023)
- More ...
-
Mixed-integer convex nonlinear optimization with gradient-boosted trees embedded
Mistry, Miten, (2021)
-
Exact lexicographic scheduling and approximate rescheduling
Letsios, Dimitrios, (2021)
-
Mean-field analysis of hybrid Markov population models with time-inhomogeneous rates
Stefanek, Anton, (2016)
- More ...