Abstract
Abstract
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A.S. Asratian, D. de Werra, A generalized class-teacher model for some timtabling problems. Eur. J. Oper. Res. 143, 531–542 (2002)
A.S. Asratian, R.R. Kamalian, Interval colorings of edges of a multigraph (in Russian). Appl Math (also ar**v:1401.8079v1) 5, 25–34 (1987)
J.A. Bondy, U.S.R. Murty, Graph Theory with Applications (North-Holland Publishing, Amsterdam, 1976)
P. Brucker, Scheduling Algorithms (Springer, Berlin, 1995)
P. Brucker, A. Krämer, Schop scheduling with multiprocessor tasks on dedicated processors. Ann. Oper. Res. 57, 13–27 (1995)
E. Cole, K. Ost, S. Schirra, Edge-coloring Bipartite Multigraphs in \(O(E \log D)\). Combinatorica 21, 5–12 (2001)
D. de Werra, An introduction to timetabling. Eur. J. Oper. Res. 19, 151–162 (1985)
D. de Werra, A.S. Asratian, S. Durand, Complexity of some special types of timetabling problems. J. Sched. 5, 171–183 (2002)
D. de Werra, T. Kis, W. Kubiak, Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J. Sched. 11, 75–83 (2008)
S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicomodity flow problems. SIAM J. Comput. 5, 691–703 (1976)
H.N. Gabow, O. Kariv, Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput. 11, 117–129 (1982)
T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time. J. ACM 23, 665–679 (1976)
C. Gotlieb, The construction of class-teacher time-tables, in Proc. IFIP Congress 62, Munich (North-Holland, Amsterdam, 1963)
O. Ittig, Scheduling with multiprocessors: a rounding network algorithm with a constant error. Master’s thesis, Memorial University of Newfoundland and EPFL, 2005
T. Kis, D. de Werra, W. Kubiak, A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. Oper. Res. Lett. 38, 129–132 (2010)
W. Kubiak, On a conjecture for the university timetabling problem. Discrete Appl. Math. 299, 26–49 (2021)
E.L. Lawler, Combinatorial Optimization. Networks and Matroids (Dover Publications, New York, 2001)
A. Schrijver, Theory of Linear and Integer Programming (Wiley, London, 1999)
É. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34, 250–256 (1986)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kubiak, W. (2022). Multiprocessor Operations. In: A Book of Open Shop Scheduling. International Series in Operations Research & Management Science, vol 325. Springer, Cham. https://doi.org/10.1007/978-3-030-91025-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-91025-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91024-2
Online ISBN: 978-3-030-91025-9
eBook Packages: Business and ManagementBusiness and Management (R0)