Skip to main content
Log in

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The sequential ordering problem with precedence relationships was introduced in Escudero [7]. It has a broad range of applications, mainly in production planning for manufacturing systems. The problem consists of finding a minimum weight Hamiltonian path on a directed graph with weights on the arcs, subject to precedence relationships among nodes. Nodes represent jobs (to be processed on a single machine), arcs represent sequencing of the jobs, and the weights are sums of processing and setup times. We introduce a formulation for the constrained minimum weight Hamiltonian path problem. We also define Lagrangian relaxation for obtaining strong lower bounds on the makespan, and valid cuts for further tightening of the lower bounds. Computational experience is given for real-life cases already reported in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Aboudi, A. Hallefjord and K. Jornsten, A facet generation and relaxation technique applied to an assignment problem with side constraints, Eur. J. Oper. Res. 50(1991)335–344.

    Google Scholar 

  2. N. Ascheuer, Ein Schnittebenenverfahren fuer ein Reihenfolgeproblem in der flexiblen Fertigung, Diplomarbeit angefertigt, Universität Augsburg, Germany (1989).

    Google Scholar 

  3. N. Ascheuer, L.F. Escudero, M. Grötschel and M. Stoer, On identifying in polynomial time violated subtour elimination and precedence forcing constraints for the sequential ordering problem, in:Integer Programming and Combinatorial Optimization Conf., ed. R. Kannan and W.R. Pulleyblank (Waterloo University Press, Waterloo, Ontario, 1990) pp. 19–28.

    Google Scholar 

  4. E. Balas, M. Fischetti and W.R. Pulleyblank, Polyhedral results for the precedence constrained ATSP,Meeting on Combinatorial Optimization, Oberwolfach, Germany (1991).

  5. P.M. Camerini, L. Fratta and F. Maffioli, A note on finding optimum branching, Networks 10(1980)81–110.

    Google Scholar 

  6. J. Edmonds, Optimum branchings, J. Res. Nat. Bureau Stand. B 71(1967)233–240.

    Google Scholar 

  7. L.F. Escudero, An inexact algorithm for the sequential ordering problem, Eur. J. Oper. Res. 37(1988)236–253.

    Google Scholar 

  8. L.F. Escudero, A production planning problem in FMS, Ann. Oper. Res. 17(1989)69–104.

    Google Scholar 

  9. L.F. Escudero, M. Guignard and K. Malik, A Lagrangian based lower bound for the sequential ordering problem with precedence relationships and deadlines, Report 92-05-05-, Decision Sciences Department, The Wharton School, University of Pennsylvania (1992).

  10. L.F. Escudero and A. Sciomachen, An approximate algorithm for the sequential ordering problem with time windows and precedence relationships, Report No. RC-16820, IBM T.J. Watson Research Center, Yorktown Heights, NY 1991.

    Google Scholar 

  11. A. Geoffrion, Lagrangian relaxation and its uses in integer programming, Math. Progr. Study 2(1974)82–114.

    Google Scholar 

  12. M. Guignard, Efficient cuts in Lagrangian relax-and-cut schemes, Report No. 92-09-07, Decision Sciences Department, The Wharton School, University of Pennsylvania (1992).

  13. M. Held, P. Wolfe and H.P. Crowder, Validation of subgradient optimization, Math. Progr. 6(1974)62–88.

    Google Scholar 

  14. T.H.C. Smith, A LIFO implicit enumeration algorithm for the asymmetric traveling salesman problem using a one-arborescence relaxation, Report MSRR 380, GSIA, Carnegie-Mellon University (1975).

  15. T.E. Tarjan, Finding optimum branchings, Networks 7(1977)25–35.

    Google Scholar 

  16. M.T.F. Timlin, Precedence constrained routing and helicopter scheduling, MS Thesis, University of Waterloo, Waterloo, Ontario, Canada (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Escudero, L.F., Guignard, M. & Malik, K. A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships. Ann Oper Res 50, 219–237 (1994). https://doi.org/10.1007/BF02085641

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02085641

Keywords

Navigation