Abstract
In the classical open shop problem, n jobs have to be processedon m machines, where both job orders and machine orders can be chosen arbitrarily.A feasible (i.e., acyclic) combination of all job orders and machine orders iscalled a (multi‐) sequence. We investigatea set of sequences which are structurally optimal in the sense that there is at least oneoptimal sequence in this set for each instance of processing times. Such sequences arecalled irreducible. Investigations about irreducible sequences are believed to provide apowerful tool to improve exact and heuristic algorithms. Furthermore, structural propertiesof sequences are important for problems with uncertain processing times.We prove necessary and sufficient conditions for the irreducibility of a sequence. Forseveral values of n and m, we give the numbers of allsequences, of the sequences satisfying each of these conditions and of the irreduciblesequences, respectively. It turns out that only a very small fraction of all sequences isirreducible. Thus, algorithms which work only on the set of irreducible sequences insteadof the set of all sequences can potentially perform much better than conventional algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.B. Akers and J. Friedman, A non-numerical approach to production scheduling problems, Operations Research 3(1955)429-442.
S. Ashour, Sequencing Theory, Springer, 1972.
H. Bräsel, Latin rectangle and scheduling theory (in German), Habilitationsschrift, Technical University Magdeburg, Germany, 1990.
H. Bräsel, M. Harborth, T. Tautenhahn and P. Willenius, On the hardness of the classical job shop problem, Working Paper, University of Magdeburg, Germany, 1997.
H. Bräsel, M. Harborth and P. Willenius, Isomorphism for digraphs and sequences of shop scheduling problems, Preprint 21/1996, University of Magdeburg, Germany, 1996.
H. Bräsel and M. Kleinau, On the number of feasible schedules of the open shop problem — an application of special Latin rectangles, Optimization 23(1992)251-260.
H. Bräsel and M. Kleinau, New steps in the amazing world of sequences and schedules, Mathematical Methods of Operations Research 43(1996)195-214.
W. Burnside, Theory of Groups of Finite Order, Cambridge University Press, 1897.
R.W. Conway, W.L. Maxwell and L.W. Miller, Theory of Scheduling, Addison Wesley, 1967.
D. de Werra, Almost nonpreemptive schedules, Annals of Operations Research 26(1990)243-256.
M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
T. Gonzalez and S. Sahni, Open-shop scheduling to minimize finish time, Journal of the Association for Computing Machinery 23(1976)665-680.
A. Goralcikova and G. Koubek, A reduct and closure algorithm for graphs, Mathematical Foundations of Computer Science 74 (1979) 301-307.
M. Kleinau, On the structure of shop scheduling problems: Number problems, reducibility and complexity (in German), Dissertation, Technical University Magdeburg, Germany, 1993.
T. Tautenhahn, Irreducible sequences — an approach to interval edge colouring trees, Preprint OR83, Faculty of Mathematical Studies, University of Southampton, UK, 1996.
Rights and permissions
About this article
Cite this article
Bräsel, H., Harborth, M., Tautenhahn, T. et al. On the set of solutions of the open shop problem. Annals of Operations Research 92, 241–263 (1999). https://doi.org/10.1023/A:1018938915709
Issue Date:
DOI: https://doi.org/10.1023/A:1018938915709