Approximation Algorithms for Time Constrained Scheduling
- 1 February 1997
- journal article
- Published by Elsevier in Information and Computation
- Vol. 132 (2) , 85-108
- https://doi.org/10.1006/inco.1996.2616
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Mutual exclusion schedulingTheoretical Computer Science, 1996
- Precoloring Extension III: Classes of Perfect GraphsCombinatorics, Probability and Computing, 1996
- New worst-case results for the bin-packing problemNaval Research Logistics (NRL), 1994
- Precoloring extension. I. Interval graphsDiscrete Mathematics, 1992
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974