Scheduling with incompatible jobs-Reference-Cited by-同舟云学术

Scheduling with incompatible jobs

Published:1993 Issue: Volume: Page:37-49
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Bodlaender Hans L.,Jansen Klaus,Woeginger Gerhard J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56402-0_34.pdf

Reference13 articles.

1. Biró, B., Hujter, M., and Tuza, Z.: Precoloring extension. I. Interval graphs. Disc. Math. (to appear)

2. Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Technical Report RUU-CS-91-44, Department of Computer Science, Utrecht University, Utrecht, the Netherlands (1991)

3. Bodlaender, H.L., Kloks, T.: Better algorithms for the pathwidth and treewidth of graphs. Proc. 18th ICALP, LNCS 510 (Springer, Berlin, 1991) 544–555

4. Fisher, M.L.: Worst-case analysis of heuristic algorithms. Management Sci 26 (1980) 1–17

5. Garey, M.R., Graham, R.L., Johnson, D.S.: Performance guarantees for scheduling algorithms. Operations Research 26 (1978) 3–21

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation results for the optimum cost chromatic partition problem;Automata, Languages and Programming;1997

2. The optimum cost chromatic partition problem;Lecture Notes in Computer Science;1997

3. Precoloring Extension III: Classes of Perfect Graphs;Combinatorics, Probability and Computing;1996-03

4. Approximation algorithms for time constrained scheduling;Parallel Algorithms for Irregularly Structured Problems;1995