Approximation Algorithms for Time Constrained Scheduling

Information and Computation

Volumn 132, Issue 2, 1997, Pages 85-108

  Jansen, Klaus ^a   Öhring, Sabine ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042565548     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.2616     Document Type: Article

References (18)

1. Baker, B. S., and Coffman, E. G. (1996), Mutual exclusion scheduling, Theor. Comput. Sci. 162, 225-243.
2. Biró, M., Hujter, M., and Tuza, Z. (1991), Precoloring extension, I: Interval graphs, Discrete Math. 100, 267-279.
3. Bodlaender, H. L., Jansen, K., and Woeginger, G. J. (1992), Scheduling with incompatible jobs, in "Workshop Graph Theoretical Concepts in Computer Science," LNCS, Vol. 657, pp. 37-49, Springer-Verlag, Berlin/New York.
4. Bodlaender, H. L., and Jansen, K. (1993), On the complexity of scheduling incompatible jobs with unit-times, in "Mathematical Foundations of Computer Science," LNCS, Vol. 711, pp. 291-300, Springer-Verlag, Berlin/New York.
5. Brandstädt, A. (1991), "Special Graph Classes - A Survey," Report SM-DU-199, Universität-Gesamthochschule Duisburg, 1991.
6. Coffman, E. G. Jr., Garey, M. R., and Johnson, D. S. (1984), Approximation algorithms for binpacking - An updated survey, in "Algorithmic Design for Computer System Design" (G. Ausiello, M. Lucertini, and P. Serafini, Eds.), pp. 49-106, Springer-Verlag, Berlin/New York.
7. Garey, M. R., Graham, R. L., Johnson, D. S., and Yao A.C.-C. (1976), Resource constrained scheduling as generalized bin-packing, J. Combin. Theory Ser. A 21, 257-298.
8. Garey, M. R., and Johnson, D. S. (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
9. Golumbic, M. C. (1980), "Algorithmic Graph Theory and Perfect Graphs," Academic Press, London.
10. Hujter, M., and Tuza, Z. (1993), Precoloring extension, II: Graph classes related to bipartite graphs, Acta Math. Univ. Comenianae 61, 1-12.
11. Hujter, M., and Tuza, Z. (1996), Precoloring extension, III: Classes of perfect graphs, Combin. Probab. Comput. 5, 35-56.
12. Irani, S., and Leung, V. (1996), Scheduling with conflicts, and applications to traffic signal control, in "Symposium on Discrete Algorithms," pp. 85-94.
13. Jansen, K., and Scheffler, P. (1992), Generalized coloring for tree-like graphs, in "Workshop Graph Theoretical Concepts in Computer Science," LNCS, Vol. 657, pp. 50-59, Springer-Verlag, Berlin/ New York.
14. Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L. (1974), Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput. 3, 256-278.
15. Kratochvil, J. (1993), Precoloring extension with fixed color bound, Acta Math. Univ. Comenianae 62, 139-153.
16. Lund, C., and Yannakakis, M. (1993), On the hardness of approximating minimization problems, in "25th Symposium on the Theory of Computing, 1993," pp. 286-293.
17. Minyi, Y. (1991), A simple proof of the inequality FFD(L) ≤ 11/9 OPT(L) + 1, ∀L for the FFD bin-packing algorithm, Acta Math. Appl. Sinica 7, 321-331.
18. Simchi-Levi, D. (1994), New worst-case results for the bin-packing problem, Naval Res. Logistics, 41, 579-585.