The mutual exclusion scheduling problem for permutation and comparability graphs

Information and Computation

Volumn 180, Issue 2, 2003, Pages 71-81

  Jansen, Klaus ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; OPERATIONS RESEARCH; PROGRAM PROCESSORS; SCHEDULING;

MUTUAL EXCLUSION;

GRAPH THEORY;

EID: 0037471680     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)00028-7     Document Type: Article

References (25)

1. N. Alon, A note on the decomposition of graphs into isomorphic matchings, Acta Mathematica Hungarica 42 (1983) 221-223.
2. B.S. Baker, E.G. Coffman, Mutual exclusion scheduling, Theoretical Computer Science 162 (1996) 225-243.
3. K.A. Baker, P.C. Fishburn, F.S. Roberts, Partial orders of dimension 2, Networks 2 (1971) 11-28.
4. M. Bartusch, R.H. Möhring, F.J. Radermacher, M-machine unit time scheduling: a report on ongoing research, in: A. Kurzhanski (Ed.), Optimization, Parallel Processing and Applications, Lecture Notes in Economics and Mathematical Systems, vol. 304, 1988, pp. 165-213.
5. P. Bjorstad, W.M. Coughran, E. Grosse, Parallel domain decomposition applied to coupled transport equations, in: D.E. Keys, J. Xu (Eds.), Domain Decomposition Methods in Scientific and Engineering Computing, AMS, Providence, 1995, pp. 369-380.
6. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt, J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer, Heidelberg, 1996.
7. H.L. Bodlaender, K. Jansen, On the complexity of scheduling incompatible jobs with unit-times, in: A.M. Borzyszkowski, S. Sokolowski (Eds.), Mathematical Foundations of Computer Science, MFCS 93, Lecture Notes in Computer Sciences, vol. 711, 1993, pp. 291-300.
8. A. Brandstädt, On improved time bounds for permutation graph problems, in: E.W. Mayr (Ed.), Graph Theoretic Concepts in Computer Science, WG 92, Lecture Notes in Computer Sciences, vol. 657, 1992, pp. 1-10.
9. E. Cohen, M. Tarsi, NP-completeness of graph decomposition problem, Journal of Complexity 7 (1991) 200-212.
10. D.G. Corneil, The complexity of generalized clique packing, Discrete Applied Mathematics 12 (1985) 233-239.
11. M. Fujii, T. Kasami, K. Ninomiya, Optimal sequencing of two equivalent processors, SIAM Journal on Applied Mathematics 17 (1969) 784-789.
12. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
13. P.C. Gilmore, A.J. Huffman, A characterization of comparability graphs and of interval graphs, Canadian Journal of Mathematics 16 (1964) 539-548.
14. P. Hansen, A. Hertz, J. Kuplinsky, Bounded vertex colorings of graphs, Discrete Mathematics 111 (1993) 305-312.
15. S. Irani, V. Leung, Scheduling with conflicts, and applications to traffic signal control, SIAM Symposium on Discrete Algorithms, SODA 96, 1996, pp. 85-94.
16. t - coloring problem, in: E.W. Mayr, C. Puech (Eds.). Symposium on Theoretical Aspects of Computer Science, STACS 95, Lecture Notes in Computer Sciences, vol. 900, 1995, pp. 409-420.
17. F. Kitagawa, H. Ikeda, An existential problem of a weight-controlled subset and its application to school time table construction, Discrete Mathematics 72 (1988) 195-211.
18. J. Krarup, D. de, Werra: Chromatic optimization: limitations, objectives, uses, references, European Journal of Operations Research 11 (1982) 1-19.
19. V. Lofti, S. Sarin, A graph coloring algorithm for large scale scheduling problems, Computers and Operations Research 13 (1986) 27-32.
20. Z. Lonc, On complexity of some chain and antichain partition problem, in: G. Schmidt, R. Berghammer (Eds.), Graph Theoretical Concepts in Computer Science, WG 91, Lecture Notes in Computer Sciences, vol. 570, 1991, pp. 97-104.
21. R.H. Möhring, Algorithmic aspects of comparability graphs and interval graphs, in: I. Rival (Ed.), Graphs and Orders, Reidel, Dordrecht, 1985, pp. 41-101.
22. R.H. Möhring, Problem 9.10, in: I. Rival (Ed.), Graphs and Orders, Reidel, Dordrecht, 1985. p. 583.
23. R.H. Möhring, Computationally tractable classes of ordered sets, in: I. Rival (Ed.), Algorithms and Orders, Kluwer Academic Publishers, Dordrecht, 1989, pp. 105-193.
24. A. Pnueli, A. Lempel, W. Even, Transitive orientation of graphs and identification of permutation graphs, Canadian Journal of Mathematics 23 (1971) 160-175.
25. K. Wagner, Monotonic coverings of finite sets, Journal of Information Processing and Cybernetics - EIK 20 (1984) 633-639.