High-multiplicity scheduling on one machine with forbidden start and completion times
Year of publication: |
October 2016
|
---|---|
Authors: | Gabay, Michaël ; Rapine, Christophe ; Brauner, Nadia |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 19.2016, 5, p. 609-616
|
Subject: | Scheduling | High-multiplicity | Availability constraints | Parameterized complexity | Fließfertigung | Assembly-line production | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research | USA | United States | Theorie | Theory |
-
A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
El-Bouri, Ahmed, (2012)
-
Walter, Rico, (2021)
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
- More ...
-
Improved lower bounds for the online bin stretching problem
Gabay, Michaël, (2017)
-
Single machine scheduling with small operator-non-availability periods
Rapine, Christophe, (2012)
-
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Kellerer, Hans, (2015)
- More ...