Mathematical Programming

, Volume 42, Issue 1–3, pp 113–123 | Cite as

S3 sets. An extension of the Beale-Tomlin special ordered sets

  • L. F. Escudero
Article
Received:

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.

Key words

Scheduling large-scale 0–1 model variable fixing coefficient reduction special ordered sets 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E.M.L. Beale and J.J.H. Forrest, “Global optimization using special ordered sets,”Mathematical Programming 10 (1976) 52–69.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    H. Crowder, E.L. Johnson and M. Padberg, Solving large-scale zero-one linear programming problems,Operations Research 31 (1983) 803–834.Google Scholar
  4. [4]
    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).Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    L.F. Escudero, “On energy generators maintenance and operations scheduling,” IBM Scientific Center Report G320-3419 (Palo Alto, California, 1981).Google Scholar
  7. [7]
    L.F. Escudero, “On maintenance scheduling of production units,”European Journal of Operational Research 9 (1982) 264–274.Google Scholar
  8. [8]
    L.F. Escudero and G. Perez, “Strategies for LP solving a general class of scheduling problems,” Trabajos de Investigacion-Operativa (to appear, 1988).Google Scholar
  9. [9]
    K. Hoffman and M. Padberg, “LP-based combinatorial problem solving,”Annals of OperationsResearch 5 (1986) 145–194.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    M.J.D. Powell, Private communication (1988).Google Scholar
  14. [14]
    J.A. Tomlin, “Special ordered sets and an application to gas supply operations planning,” Mathematical programming 42 (1988) 69–84 (this issue).Google Scholar
  15. [15]
    T.J. Van Roy and L.A. Wolsey, “Solving mixed integer programming problems using automatic reformulation,”Operations Research 35 (1987) 45–57.Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1988

Authors and Affiliations

  • L. F. Escudero
    • 1
    • 2
  1. 1.IBM GMTCSindelfingenFR Germany
  2. 2.IBM Scientific CenterMadridSpain

Personalised recommendations