On the complexity of project scheduling to minimize exposed time
Year of publication: |
2014
|
---|---|
Authors: | Pinker, Edieal ; Szmerekovsky, Jospeh ; Tilson, Vera |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 237.2014, 2 (1.9.), p. 448-453
|
Subject: | Complexity theory | Project scheduling | Secret project | NP-complete | Polynomial algorithm | Projektmanagement | Project management | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Komplexe Systeme | Complex systems | Komplexitätsmanagement | Complexity management |
-
New complexity results on scheduling problem in a robotic cell
Chikhi, Nacira, (2017)
-
A multivariate complexity analysis of the material consumption scheduling problem
Bentert, Matthias, (2023)
-
Computational complexity of convoy movement planning problems
Gopalan, Ram, (2015)
- More ...
-
On the complexity of project scheduling to minimize exposed time
Pinker, Edieal, (2014)
-
Technical Note-Managing a Secret Project
Pinker, Edieal, (2013)
-
Monotonicity properties of wholesale price contracts
Tilson, Vera, (2008)
- More ...