Access the full text.
Sign up today, get DeepDyve free for 14 days.
I. Bárány (1981)
A Vector-Sum Theorem and its Application to Improving Flow Shop GuaranteesMath. Oper. Res., 6
W. Banaszczyk (1987)
The Steinitz constant of the plane.Journal für die reine und angewandte Mathematik (Crelles Journal), 1987
I. Bárány (2008)
On the Power of Linear Dependencies
E. Steinitz
Bedingt konvergente Reihen und konvexe Systeme.Journal für die reine und angewandte Mathematik (Crelles Journal), 1913
R. Cole, Kirstin Ost, S. Schirra (1999)
Edge-Coloring Bipartite Multigraphs in O(E logD) TimeCombinatorica, 21
T. Gonzalez, S. Sahni (1976)
Open Shop Scheduling to Minimize Finish TimeJ. ACM, 23
D. Atkin (2000)
OR scheduling algorithms.Anesthesiology, 93 1
E. Buffa (1977)
Graph Theory with ApplicationsJournal of the Operational Research Society
H. Gabow, O. Kariv (1982)
Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM J. Comput., 11
G. Ausiello, A. Marchetti-Spaccamela, P. Crescenzi, G. Gambosi, M. Protasi, V. Kann (1999)
Complexity and Approximation
[We begin by introducing notation, terminology, and definitions for traditional open shop scheduling.]
Published: Oct 31, 2021
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.