Skip to main content
Log in

The economic lot scheduling problem under extended basic period and power-of-two policy

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The economic lot scheduling problem schedules the production of several different products on a single machine over an infinite planning horizon. In this paper, a nonlinear integer programming model is used to determine the optimal solution under the extended basic period and power-of-two policy. A small-step search algorithm is presented to find a solution which approaches optimal when the step size approaches zero, where a divide-and-conquer procedure is introduced to speed up the search. Further a faster heuristic algorithm is proposed which finds the same solutions in almost all the randomly generated sample cases.

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.

Similar content being viewed by others

References

  1. Boctor F.F.: The g-group heuristic for single machine lot scheduling. Int. J. Prod. Res. 25, 363–379 (1987)

    Article  MATH  Google Scholar 

  2. Bomberger E.: A dynamic programming approach to a lot size scheduling problem. Manage. Sci. 12, 778–784 (1966)

    Article  Google Scholar 

  3. Chatfield D.: The economic lot scheduling problem: a pure genetic search approach. Comput. Oper. Res. 34, 2865–2881 (1987)

    Article  Google Scholar 

  4. Dobson G.: The economic lot scheduling problem: achieving feasibility using time-varying lot sizes. Oper. Res. 35, 764–771 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Doll C.L., Whybark D.C.: An interactive procedure for the single-machine multi-product lot scheduling problem. Manage. Sci. 20, 50–55 (1973)

    Article  Google Scholar 

  6. Elmaghraby S.E.: The economic lot scheduling problem (ELSP): review and extensions. Manage. Sci. 24, 587–598 (1978)

    Article  MATH  Google Scholar 

  7. Geng P.C., Vickson R.G.: Two heuristics for the economic lot scheduling problem: an experimental study. Nav. Res. Logist. 35, 605–617 (1988)

    Article  MATH  Google Scholar 

  8. Grznar J., Riggle C.: An optimal algorithm for the basic period approach to the economic lot scheduling problem. Omega 25, 355–364 (1997)

    Article  Google Scholar 

  9. Haessler R.: An improved extended basic period procedure for solving the economic lot scheduling problem. AIIE Trans. 11, 355–364 (1979)

    Google Scholar 

  10. Hanssmann F.: Operations Research in Production and Inventory Control. Wiley, New York (1962)

    MATH  Google Scholar 

  11. Lopez M.A., Kingsman B.G.: The economic lot scheduling problem: theory and practice. Int. J. Prod. Econ. 23, 147–164 (1991)

    Article  Google Scholar 

  12. Madigan J.C.: Scheduling a multi-product single machine system for an infinite planning period. Manage. Sci. 14, 713–719 (1968)

    Article  Google Scholar 

  13. Roundy R.: Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems. Manage. Sci. 35, 1433–1442 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. Yao M., Elmaghraby S.: The economic lot scheduling problem under power-of-two policy. Comput. Math. Appl. 41, 1379–1393 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Zipkin P.: Computing optimal lot sizes in the economic lot scheduling problem. Oper. Res. 39, 56–63 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hainan Sun.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, H., Huang, HC. & Jaruphongsa, W. The economic lot scheduling problem under extended basic period and power-of-two policy. Optim Lett 4, 157–172 (2010). https://doi.org/10.1007/s11590-009-0154-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-009-0154-5

Keywords

Navigation