On the approximability of an interval scheduling problem
- 1 September 1999
- journal article
- research article
- Published by Wiley in Journal of Scheduling
- Vol. 2 (5) , 215-227
- https://doi.org/10.1002/(sici)1099-1425(199909/10)2:5<215::aid-jos27>3.0.co;2-y
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Non-approximability Results for Scheduling Problems with Minsum CriteriaPublished by Springer Nature ,1998
- The assembly of printed circuit boards: A case with multiple machines and multiple board typesEuropean Journal of Operational Research, 1997
- Hardness of approximating problems on cubic graphsPublished by Springer Nature ,1997
- The Optimal Cost Chromatic Partition problem for trees and interval graphsPublished by Springer Nature ,1997
- On the k-coloring of intervalsDiscrete Applied Mathematics, 1995
- Note on scheduling intervals on-lineDiscrete Applied Mathematics, 1995
- On approximation properties of the Independent set problem for degree 3 graphsPublished by Springer Nature ,1995
- Matching and Vertex Packing: How “hard” are They?Published by Elsevier ,1993
- On the complexity of scheduling tasks with discrete starting timesOperations Research Letters, 1992
- Complexity results for scheduling tasks with discrete starting timesJournal of Algorithms, 1982