Abstract
In this work an extension of the Beale-Tomlin special ordered sets is introduced that has proved to be efficient for solving certain types of open shop scheduling problems. Besides their usual characteristics, exclusivity constraints in the jobs are allowed, more general than tree-like precedence structures are considered, and semi-active schedules that cannot be labeled as non-optimal solutions may occur. The problem is formulated as a large-scale 0–1 model. Computational experience on some real-life problems is reported.
Similar content being viewed by others
References
E.M.L. Beale and J.J.H. Forrest, “Global optimization using special ordered sets,”Mathematical Programming 10 (1976) 52–69.
E.M.L. Beale and J.A. Tomlin, “Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables,” in: J. Lawrence, ed.,Operational Research 69 (Tavistock Publishing, London, 1970) pp. 447–454.
H. Crowder, E.L. Johnson and M. Padberg, Solving large-scale zero-one linear programming problems,Operations Research 31 (1983) 803–834.
H. Engelke and L.F. Escudero, “A hierarchical approach to a generic floor shop problem in FMS,” working paper, IBM GMTC (Sindelfingen, FR Germany, 1987).
L.F. Escudero, “Special sets in mathematical programming, State-of-the-art survey,” in: E. Alarcon and C. Brebbia, eds.,Applied Numerical Modeling (Pentech Press, London, 1979) 535–551.
L.F. Escudero, “On energy generators maintenance and operations scheduling,” IBM Scientific Center Report G320-3419 (Palo Alto, California, 1981).
L.F. Escudero, “On maintenance scheduling of production units,”European Journal of Operational Research 9 (1982) 264–274.
L.F. Escudero and G. Perez, “Strategies for LP solving a general class of scheduling problems,” Trabajos de Investigacion-Operativa (to appear, 1988).
K. Hoffman and M. Padberg, “LP-based combinatorial problem solving,”Annals of OperationsResearch 5 (1986) 145–194.
E.L. Johnson, M.M. Kostreva and U. Suhl, “Solving 0–1 integer programming problems arising from large-scale planning models,”Operations Research 33 (1985) 803–819.
A. Land and S. Powell, “Computer codes for problems of integer programming,” in: P. Hammer, E.L. Johnson and B.H. Korte, eds.,Discrete Optimization 2 (North-Holland, The Netherlands, 1979) 221–269.
E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, “Recent developments in deterministic sequencing and scheduling: a survey,” in: M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Deterministic and Stochastic Scheduling (Reidel, Dordrecht, 1982) pp. 35–73.
M.J.D. Powell, Private communication (1988).
J.A. Tomlin, “Special ordered sets and an application to gas supply operations planning,” Mathematical programming 42 (1988) 69–84 (this issue).
T.J. Van Roy and L.A. Wolsey, “Solving mixed integer programming problems using automatic reformulation,”Operations Research 35 (1987) 45–57.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Escudero, L.F. S3 sets. An extension of the Beale-Tomlin special ordered sets. Mathematical Programming 42, 113–123 (1988). https://doi.org/10.1007/BF01589396
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01589396