Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence
Year of publication: |
December 2017
|
---|---|
Authors: | Cheref, Azeddine ; Agnetis, Alessandro ; Artigues, Christian ; Billaut, Jean-Charles |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 6, p. 681-693
|
Subject: | Scheduling | Delivery | Batching | Complexity | Dynamic programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Dynamische Optimierung | Produktionssteuerung | Production control |
-
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Cheng, T. C. E., (2021)
-
Single machine scheduling problems with generalised due-dates and job-rejection
Gerstl, Enrique, (2017)
-
Scheduling with regular performance measures and optional job rejection on a single machine
Mor, Baruch, (2020)
- More ...
-
Multiagent scheduling : models and algorithms
Agnetis, Alessandro, (2014)
-
Nash equilibria for the multi-agent project scheduling problem with controllable processing times
Agnetis, Alessandro, (2015)
-
Multiagent Scheduling : Models and Algorithms
Agnetis, Alessandro, (2014)
- More ...