Extensions of coloring models for scheduling purposes

European Journal of Operational Research

Volumn 92, Issue 3, 1996, Pages 474-492

  De Werra, D ^a  

^a EPFL   (Switzerland)

Author keywords

Chromatic scheduling; Combinatorial optimization; Flexible manufacturing systems; Production; Timetabling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FLEXIBLE MANUFACTURING SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PRODUCTION CONTROL; SCHEDULING;

CHROMATIC SCHEDULING; COLORING MODELS; TIMETABLING;

OPERATIONS RESEARCH;

EID: 0030576489     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(96)00013-6     Document Type: Article

References (29)

1. Bartholdi, III, J.J., Orlin, J.B., and Ratliff H.D., "Cyclic scheduling via integer programs with circular ones", Operations Research 28 (1980) 1074-1075.
2. Berge, C., Graphes, Gauthier-Villars, Paris, 1983.
3. Berge, C., "Balanced matrices", Mathematical Programming 2 (1972) 19-31.
4. Blazewicz, J., Cellary, W., Slowinski, R., and Weglarz, J., Scheduling under Resource Constraints: Deterministic Models, Baltzer, Basel, 1986.
5. Blazewicz, J., Ecker, K., Schmidt, G., and Weglarz, J., Scheduling in Computer and Manufacturing Systems, Springer, Berlin, 1993.
6. ij = 1, tree/Cmax] open shop problem", European Journal of Operational Research 72 (1994) 125-134.
7. Dauscha, W., Modrow, H.D., and Neumann, A., "On cyclic sequence types for constructing cyclic schedules", Zeitschrift für Operations Research 29 (1965) 1-30.
8. Even, S., Itai, A., and Shamir, A., "On the complexity of timetable and multicommodity flow problems", SIAM Journal on Computing 5 (1976) 691-703.
9. Folkman, J., and Fulkerson, D.R., "Edge colorings in bipartite graphs", in: Combinatorial Mathematics and its Applications, University of North Carolina Press, Chapel Hill, NC, 1969, 561-577.
10. Ford, L.R., and Fulkerson, D.R., Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
11. Gonzalez, T., and Sahni, S., "Open shop scheduling to minimize finish time", Journal of the ACM 23 (1976) 665-679.
12. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969.
13. Jurisch, B., and Kubiak, W., "Open shops with renewable resources", submitted for publication, 1993.
14. Kamoun, H., and Sriskandarajah, C., "The complexity of scheduling jobs in repetitive manufacturing systems", University of Toronto, May 1992.
15. Kubale, M., "Some results concerning the complexity of restricted colorings of graphs", Discrete Applied Mathematics 36 (1992) 35-46.
16. Kubale, M., "Interval edge coloring of a graph with forbidden colors", Discrete Mathematics 121 (1993) 135-143.
17. Kubale, M., "Open shop scheduling of jobs with unit-time tasks and integer release time/deadline intervals", submitted for publication.
18. Mahadev, N.V.R., Peled, U.N., Hoffman, A.J., and de Werra D., "Restrictions and preassignments in preemptive open shop scheduling", to appear in Discrete Applied Mathematics.
19. Redi, S.S., and Ramamoorthy, C.V., "On the flow-shop sequencing problem with no wait in process", Operational Research Quarterly 23 (1972) 323-331.
20. de Werra, D., "Heuristics for graph coloring", in: G. Tinhofer, E. Mayr, H. Noltemeier, and M. Syslo (eds.), Computational Graph Theory, Springer, New York, 1990, 191-208.
21. de Werra, D., and Solot, Ph., "Compact cylindrical chromatic scheduling", SIAM Journal on Discrete Mathematics 4 (1991) 528-534.
22. de Werra, D., "Graph-theoretical models for preemptive scheduling", in: R. Slowinski, J. Weglarz (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989, 171-185.
23. de Werra, D., and Blazewicz, J., "Some preemptive open shop scheduling problems with a renewable or a non-renewable resource", Discrete Applied Mathematics 35 (1992) 205-219.
24. de Werra, D., Mahadev, N.V.R., and Solot, Ph., "Edge chromatic scheduling with simultaneity constraints", SIAM Journal on Discrete Mathematics 6 (1993) 631-641.
25. de Werra, D., and Solot, Ph., "Some graph-theoretical models for scheduling in automated production systems", Networks 23 (1993) 651-660.
26. de Werra, D., and Solot, Ph., "Some graph coloring models for cyclic scheduling", in: Ph. Chrétienne, E.G. Coffman, J.K. Lenstra and Z. Liu (eds.), Scheduling Theory and its Applications, Wiley, New York, 1995.
27. de Werra, D., Glover, F., and Silver, E.A., "A chromatic scheduling model with costs", IIE Transactions 27 (1995) 181-189.
28. de Werra, D., and Erschler, J., "Preemptive open shop scheduling with additional constraints", to appear in Graphs and Combinatorics.
29. Whitney, H., "Non-separable and planar graphs", Transactions of the AMS 34 (1932) 339-362.