Compact scheduling in open shop with zero-one time operations

INFOR

Volumn 37, Issue 1, 1999, Pages 37-47

  Giaro, Krzysztof ^a,b   Kubale, Marek ^a,b   Malafiejski, Michal ^a,c  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^b Technical University of Gdansk ^*  (Poland)

^c UNIVERSITY OF GDA SK   (Poland)

Author keywords

Bipartite graph; Compact schedule; Consecutive edge coloring; No wait schedule; NP completeness

Indexed keywords

EID: 0346656303     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.1999.11732367     Document Type: Article

References (7)

1. Bartholdi J.J and McCroan K.L., Scheduling interviews for a job fair, Oper. Res. 38 (1990), 951-960.
2. Cole R. and Hopcroft J.E., On edge coloring bipartite graphs, SIAM J. Comput. 11 (1982), 540-546.
3. Gabow H.N., Using Euler partitions to edge color bipartite graphs, Int. J. Comp. Inf. Sci. 5 (1976), 345-355.
4. Giaro K., The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard, Ars Combin. 47 (1997), 287-298.
5. Giaro K. and Kubale M., Consecutive edge-colorings of complete and incomplete Cartesian products of graphs, Cong. Numer. 128 (1997), 143-149.
6. Giaro K., Kubale M. and Malafiejski M., On the deficiency of bipartite graphs, Disc. Appl. Math, (to appear).
7. Gonzalez T. and Sahni S., Open shop scheduling to minimize finish time, J. A CM 23 (1976), 665-679.