Skip to main content
Log in

Statistical search methods for lotsizing problems

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

Abstract

This paper reports on our experiments with statistical search methods for solving lotsizing problems in production planning. In lotsizing problems the main objective is to generate a minimum cost production and inventory schedule, such that (i) customer demand is satisfied, and (ii) capacity restrictions imposed on production resources are not violated. We discuss our experiences in solving these, in general NP-hard, lotsizing problems with popular statistical search techniques like simulated annealing and tabu search. The paper concludes with some critical remarks on the use of statistical search methods for solving lotsizing problems.

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. P. Afentakis, B. Gavish and U. Karmarkar, Computational efficient optimal solutions to the lotsizing problem in multistage assembly systems, Manag. Sci. 30(1984)222–239.

    Google Scholar 

  2. P. Afentakis and B. Gavish, Optimal lot sizing for complex product structures, Oper. Res. 34(1987)237–249.

    Google Scholar 

  3. E. Arkin, D. Joneja and R. Roundy, Computational complexity of uncapacitated multi-echelon production planning problems, Oper. Res. Lett. 8(1989)61–66.

    Google Scholar 

  4. P.J. Billington, J.O. McClain and L.J. Thomas, Mathematical programming approaches to capacity-constrained MRP systems: review, formulation and problem reduction, Manag. Sci. 29(1983)1126–1141.

    Google Scholar 

  5. P.J. Billington, J.O. McClain and L.J. Thomas, Heuristics for multilevel lotsizing with a bottleneck, Manag. Sci. 32(1986)989–1006.

    Google Scholar 

  6. P.J. Billington, J. Blackburn, J. Maes, R. Millen and L.N. Van Wassenhove, Multi-product scheduling in capacitated multi-stage serial systems, Technical Report 8908/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands (1989), forthcoming in IIE Trans.

    Google Scholar 

  7. J.D. Blackburn and R.A. Millen, Improvised heuristics for multistage requirements planning systems, Manag. Sci. 28(1982)44–56.

    Google Scholar 

  8. D. Cattrysse, M. Salomon, R. Kuik and L.N. Van Wassenhove, Capacitated lotsizing with setup times: A comparison between Lagrangian relaxation, simulated annealing and tabu search, Unpublished manuscript, Erasmus University, Rotterdam, The Netherlands (1991).

    Google Scholar 

  9. D. de Werra and A. Hertz, Tabu search techniques: a tutorial and an application to neural networks, OR Spektrum 11(1989)131–141.

    Google Scholar 

  10. M. Florian, J.K. Lenstra and A.H.G. Rinnooy Kan, Deterministic production planning: algorithms and complexity, Manag. Sci. 26(1980)12–20.

    Google Scholar 

  11. R.S. Garfinkel and G.L. Nemhauser, Set partitioning problem: set covering with equality constraints, Oper. Res. 17(1969)848–856.

    Google Scholar 

  12. F. Glover, Tabu search, CAAI-Report 88-3, Center for Applied Artificial Intelligence, Graduate School of Business, University of Colorado, Boulder, CO (1988).

    Google Scholar 

  13. F. Glover and H.J. Greenberg, New approaches for heuristic search: a bilateral linkage with artificial intelligence, Eur. Oper. Res. 39(1989)119–126.

    Google Scholar 

  14. L.G. Khachian, A polynomial time algorithm for linear programming, Dokl. Akad. Nauk SSSR 244(1979)1093–1096. [English trans. in Soviet Math. Dokl. 20(1979)191–194].

    Google Scholar 

  15. R. Kuik and M. Salomon, The multi-level lotsizing problem: evaluation of a stochastic optimization heuristic, Eur. J. Oper. Res. 45(1990)25–37.

    Google Scholar 

  16. R. Kuik, M. Salomon, L.N. Van Wassenhove and J. Maes, Linear programming, simulated annealing and tabu search heuristics for multilevel lotsizing with a bottleneck, Technical Report 8964/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands (1989), forthcoming in IIE Trans.

    Google Scholar 

  17. P.J.M. van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications (Reidel, Dordrecht, The Netherlands, 1987).

    Google Scholar 

  18. J. Maes, J.O. McClain and L.N. Van Wassenhove, Multilevel capacitated lotsizing complexity and LP-based heuristics, Eur. J. Oper. Res. 53(1991)131–148.

    Google Scholar 

  19. J.O. McClain, L.J. Thomas and E.N. Weiss, Efficient solutions to a linear programming model for production scheduling with capacity constraints and no initial stock, IIE Trans. 21(1989)144–152.

    Google Scholar 

  20. K. Rosling, Optimal lot-sizing for dynamic assembly systems, Technical Report 152, Linköping Institute of Technology, Sweden (1985).

    Google Scholar 

  21. M. Salomon,Deterministic Lotsizing Models for Production Planning, Lecture Notes in Economics and Mathematical Systems, vol. 355, ed. M. Beckmann and W. Krelle (Springer, 1991).

  22. L. Schrage,User Manual for Linear, Integer, and Quadratic Programming with LINDO (The Scientific Press, Redwood City, 1987).

    Google Scholar 

  23. W.W. Trigeiro, L.J. Thomas and J.O. McClain, Capacitated lot sizing with setup times, Manag, Sci. 35(1989)353–366.

    Google Scholar 

  24. A.F. Veinott, Minimum concave-cost solution to Leontief substitution models of multifacility inventory systems, Oper. Res. 17(1969)262–291.

    Google Scholar 

  25. H. Wagner and T.H. Whitin, Dynamic version of the economic lot size model, Manag. Sci. 5(1958)88–96.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Salomon, M., Kuik, R. & Van Wassenhove, L.N. Statistical search methods for lotsizing problems. Ann Oper Res 41, 453–468 (1993). https://doi.org/10.1007/BF02023005

Download citation

  • Issue Date:

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

Keywords

Navigation