Skip to main content
SpringerLink
Log in

The Economic Lot Scheduling Problem without Capacity Constraints

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

Abstract

This study presents a comprehensive analysis on the Economic Lot Scheduling Problem (ELSP) without capacity constraints. We explore the optimality structure of the ELSP without capacity constraints and discover that the curve for the optimal objective values is piecewise convex with repsect to B, i.e., the values of basic period. The theoretical properties of the junction points on the piecewise convex curve not only provides us the information on “which product i” to modify, but also on “where on the B-axis” to change the set of optimal multpliers in the search process. By making use of the junction points, we propose an effective search algorithm to secure a global optimal solution for the ELSP without capacity constraints. Also, we use random experiments to verify that the proposed algorithm is efficient. The results in this paper lay important foundation for deriving an efficient heuristic to solve the conventional ELSP with capacity constraints.

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

Access this article

Log in via an institution

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

  • Axsäter, S. (1982). “Alternative Dynamic Programming Approaches to Obtain Upper Bounds for the Economic Lot Scheduling Problem.” Engineering Costs and Production Economics 6, 17–23.

    Google Scholar 

  • Boctor, F.F. (1987). “The G-Group Heuristic for Single Machine Lot Scheduling.” International Journal of Production Research 25, 363–379.

    Google Scholar 

  • Bomberger, E. (1966). “A Dynamic Programming Approach to a Lot Size Scheduling Problem.” Management Science 12, 778–784.

    Google Scholar 

  • Davis, S.G. (1990). “Scheduling Economic Lot Size Production Runs.” Management Science 36, 985–998.

    Google Scholar 

  • Doll, C.L. and D.C. Whybark. (1973). “An Interactive Procedure for the Single-Machine Multi-Product Lot Scheduling Problem.” Management Science 20, 50–55.

    Google Scholar 

  • Elmaghraby, S.E. (1976). “The Economic Lot Scheduling Problem (ELSP): Review and Extension.” Report 112, Graduate Program in Operations Research, North Carolina State University.

  • Elmaghraby, S.E. (1978). “The Economic Lot Scheduling Problem (ELSP): Review and Extension.” Management Science 24, 587–597.

    Google Scholar 

  • Geng, P.C. and R.G. Vickson. (1988). “Two Heuristics for the Economic Lot Scheduling Problem: An Experimental Study.” Naval Research Logistics 35, 605–617.

    Google Scholar 

  • Goyal, S.K. (1973). “Scheduling a Multi-Product Single-Machine System.” Operational Research Quarterly 24, 261–266.

    Google Scholar 

  • Haessler, R. (1979). “An Improved Extended Basic Period Procedure for Solving the Economic Lot Scheduling Problem.” AIIE Transactions 11, 336–340.

    Google Scholar 

  • Haessler, R. and S. Hogue. (1976). “A Note on the Single Machine Multi-Product Lot Scheduling Problem.” Management Science 22, 909–912.

    Google Scholar 

  • Hanssmann, F. (1962). Operations Research in Production and Inventory. New York: Wiley, pp. 158–160.

    Google Scholar 

  • Hsu, W.L. (1983). “On the General Feasibility of Scheduling Lot Sizes of Several Products on One Machine.” Management Science 29, 93–105.

    Google Scholar 

  • Lopez, M.A. and B.G. Kingsmans. (1991). “The Economic Lot Scheduling Problem: Theory and Practice.” International Journal of Production Economics 23, 147–164.

    Google Scholar 

  • Madigan, J.C. (1968). “Scheduling a Multi-Product Single Machine System for an Infinite Planning Period.” Management Science 14, 713–719.

    Article  Google Scholar 

  • Neter, J., W. Wasserman, and M. Kutner. (1996). Applied Linear Statistical Models. Chicago, IL: Irvine.

    Google Scholar 

  • Park, K.S. and D.K. Yun. (1984). “A Stepwise Partial Enumeration Algorithm for the Economic Lot Scheduling Problem.” IIE Transactions 16, 363–370.

    Google Scholar 

  • van Eijs, M.J.G. (1993). “A Note on the Joint Replenishment Problem under Constant Demand.” Journal of the Operational Research Society 44, 185–191.

    Google Scholar 

  • Yao, M.J. (1999). “The Economic Lot Scheduling Problem with Extension to Multiple Resource Constraints.” Unpublished Ph.D. Dissertation. Raleigh, NC: North Carolina State University, USA.

  • Yao, M.J. and S.E. Elmaghraby. (2001). “The Economic Lot Scheduling Problem under Power-of-Two Policy.” Computers and Mathematics with Applications 41, 1379–1393.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Enterprise Information, Tunghai University, P.O. Box 985, Taichung City, 40407, Taiwan

    Ming-Jong Yao

Authors
  1. Ming-Jong Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ming-Jong Yao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yao, MJ. The Economic Lot Scheduling Problem without Capacity Constraints. Ann Oper Res 133, 193–205 (2005). https://doi.org/10.1007/s10479-004-5033-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-004-5033-y

Keywords

Search

Navigation