On the complexity of scheduling tasks with discrete starting times
- 30 November 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 12 (5) , 293-295
- https://doi.org/10.1016/0167-6377(92)90087-j
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Complexity results for scheduling tasks with discrete starting timesJournal of Algorithms, 1982
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976