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.
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.
Boctor, F.F. (1987). “The G-Group Heuristic for Single Machine Lot Scheduling.” International Journal of Production Research 25, 363–379.
Bomberger, E. (1966). “A Dynamic Programming Approach to a Lot Size Scheduling Problem.” Management Science 12, 778–784.
Davis, S.G. (1990). “Scheduling Economic Lot Size Production Runs.” Management Science 36, 985–998.
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.
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.
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.
Goyal, S.K. (1973). “Scheduling a Multi-Product Single-Machine System.” Operational Research Quarterly 24, 261–266.
Haessler, R. (1979). “An Improved Extended Basic Period Procedure for Solving the Economic Lot Scheduling Problem.” AIIE Transactions 11, 336–340.
Haessler, R. and S. Hogue. (1976). “A Note on the Single Machine Multi-Product Lot Scheduling Problem.” Management Science 22, 909–912.
Hanssmann, F. (1962). Operations Research in Production and Inventory. New York: Wiley, pp. 158–160.
Hsu, W.L. (1983). “On the General Feasibility of Scheduling Lot Sizes of Several Products on One Machine.” Management Science 29, 93–105.
Lopez, M.A. and B.G. Kingsmans. (1991). “The Economic Lot Scheduling Problem: Theory and Practice.” International Journal of Production Economics 23, 147–164.
Madigan, J.C. (1968). “Scheduling a Multi-Product Single Machine System for an Infinite Planning Period.” Management Science 14, 713–719.
Neter, J., W. Wasserman, and M. Kutner. (1996). Applied Linear Statistical Models. Chicago, IL: Irvine.
Park, K.S. and D.K. Yun. (1984). “A Stepwise Partial Enumeration Algorithm for the Economic Lot Scheduling Problem.” IIE Transactions 16, 363–370.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s10479-004-5033-y