Scheduling subject to resource constraints: classification and complexity
- 1 January 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 5 (1) , 11-24
- https://doi.org/10.1016/0166-218x(83)90012-4
Abstract
No abstract availableKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Deadline scheduling of tasks with ready times and resource constraintsInformation Processing Letters, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]ACM Transactions on Mathematical Software, 1977
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975