Complexity of some special types of timetabling problems

Journal of Scheduling

Volumn 5, Issue 2, 2002, Pages 171-183

  De Werra, D ^a   Asratian, A S ^b   Durand, S ^c  

^a EPFL   (Switzerland)

^b LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

^c UNIVERSITY OF AVIGNON   (France)

Author keywords

Chromatic index; Chromatic scheduling; Edge coloring; School timetabling; Timetabling

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS;

CHROMATIC INDEX; CHROMATIC SCHEDULING; EDGE COLORING; SCHOOL TIMETABLING;

SCHEDULING;

EID: 0346387208     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.97     Document Type: Article

References (19)

1. Asratian AS, Miruman AN. Transformation of edge colorings of a bipartite multigraph and their applications. Soviet Mathematics Doklady 1991; 43(1):1-3.
2. Asratian AS, Kamalian RR. Investigation on interval edge colorings of graphs. Journal of Combinatorial Theory Series B 1994; 62:34-43.
3. Asratian AS, Denley T, Häggkvist R. Bipartite graphs and their applications. Cambridge Tracts in Mathematics, Vol. 131. Cambridge University Press: Cambridge, 1998.
4. Asratian AS, de Werra D. A university timetable problem: complexity and existence theorems, to appear in European Journal of Operational Research.
5. Blazewicz J, de Werra D. Some preemptive open shop scheduling problems with a renewable or a non-renewable resource. Discrete Applied Mathematics 1992; 35:205-219.
6. Burke E, Ross P (eds). Practice and Theory of Automated Timetabling. Springer: Berlin, 1996.
7. Burke E, Carter M (eds). Practice and Theory of Automated Timetabling 11. Springer: Berlin, 1998.
8. Hilton AJW. School of Timetables. Annals of Discrete Mathematics 1981; 11:177-188.
9. Kubale M. Open shop problem with zero-one time operations and integer release data/deadline intervals. Discrete Applied Mathematics 1997; 76:213-223.
10. de Werra D. Restricted coloring models for timetabling. Discrete Mathematics 1997; 165/166:161-170.
11. de Werra D. The combinatorics of timetabling. European Journal of Operational Research 1997; 96:504-513.
12. Berge C. Graphes. Gauthier-Villars: Paris, 1983.
13. Garey MR, Johnson DS. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman: New York, 1979.
14. Blazewicz J, Ecker KH, Pesch E, Schmidt G, Weglarz J. Scheduling Computer and Manufacturing Processes. Springer: Berlin, 1996.
15. Asratian AS, Kamalian RR. Interval edge colouring of multigraphs. Applied Mathematics Yerevan University 1987; 5:25-34 (in Russian).
16. Even S, Itai A, Shamir A. On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computers 1976; 5:691-703.
17. Ford LR, Fulkerson DR. Flows in Networks. Princeton University Press: Princeton, NJ, 1962.
18. de Werra D. Extensions of coloring models for scheduling purposes. European Journal of Operations Research 1996; 92:474-492.
19. de Werra D. An Introduction to Timetabling. European Journal of Operations Research 1985; 19:151-162.