A linear time algorithm for restricted bin packing and scheduling problems
- 30 June 1983
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 2 (2) , 80-83
- https://doi.org/10.1016/0167-6377(83)90042-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- Deadline scheduling of tasks with ready times and resource constraintsInformation Processing Letters, 1979
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer SystemsJournal of the ACM, 1975