Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning
R. Rudek
Year of publication: |
2014
|
---|---|
Authors: | Rudek, R. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 65.2014, 8, p. 1170-1176
|
Subject: | scheduling | learning effect | computational complexity | Lernprozess | Learning process | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics |
Saved in:
Saved in favorites
Similar items by subject
-
Toksari, M. Duran, (2016)
-
Ozturk, Onur, (2017)
-
Wang, Jian-Jun, (2015)
- More ...
Similar items by person
-
Scheduling jobs under an aging effect
Janiak, Adam, (2010)
- More ...