A complete 4-parametric complexity classification of short shop scheduling problems
Year of publication: |
2012
|
---|---|
Authors: | Kononov, Alexander ; Sevastyanov, Sergey ; Sviridenko, Maxim |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 15.2012, 4, p. 427-446
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Klassifikation | Classification |
-
A representation scheme for integrated production and outbound distribution models
Meinecke, Christian, (2014)
-
Scheduling problems under learning effects : classification and cartography
Azzouz, Ameni, (2018)
-
Scheduling subjekt to resource constraints : classification and complexity
Blazewicz, J., (1980)
- More ...
-
Efficient approximation algorithms for the routing open shop problem
Chernykh, Ilya, (2013)
-
Integer preemptive scheduling on parallel machines
Baptiste, Philippe, (2012)
-
An exact solution with an improved running time for the routing flow shop problem with two machines
Chernykh, Ilya, (2024)
- More ...