Open shop problem with zero - One time operations and integer release date/deadline intervals

Discrete Applied Mathematics

Volumn 76, Issue 1-3, 1997, Pages 213-223

  Kubale, Marek ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Bipartite graph; Deadline; Edge coloring; NP completeness; Open shop; Polynomial algorithm; Release date; Scheduling

Indexed keywords

EID: 0043128671     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00126-6     Document Type: Article

References (12)

1. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
2. P. Brucker, B. Jurisch and M. Jurisch, Open shop problems with unit time operations, Zeit. Oper. Res. 37 (1993) 59-73.
3. Y. Cho and S. Sahni, Preemptive scheduling of independent jobs with release and due times on open, flow and job shops, Oper. Res. 29 (1981) 511-522.
4. R. Cole and J.E. Hopcroft, On edge coloring bipartite graphs, SIAM J. Comput. 11 (1982), 540-546.
5. G.N. Frederickson, Scheduling unit-time tasks with integer release times and deadlines, Inform. Processing Lett. 16 (1983) 171-173.
6. T. Gonzales, Unit execution time shop problems, Math. Oper. Res. 7 (1982) 57-66.
7. T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, J. ACM 23 (1976) 665-679.
8. H. Groeflin, Feasible graph coloring and a generalization of perfect graphs, Technical Report no. 199, University of Fribourg (1992).
9. R. Häggkvist, Restricted edge-colourings of bipartite graphs, manuscript, University of Stockholm, (1983).
10. H. Kellerer, T. Tautenhahn and G. Woeginger, Open shop scheduling with release dates to minimize maximum lateness, Naval Res. Logist. Quart., to appear.
11. M. Kubale, Some results concerning the complexity of restricted colorings of graphs, Discrete Appl. Math. 36 (1992) 35-46.
12. D. de Werra and Ph. Solot, Some graph-theoretical models for scheduling in automated production systems, Networks 23 (1993) 651-660.