IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v133y2005i1p193-20510.1007-s10479-004-5033-y.html
   My bibliography  Save this article

The Economic Lot Scheduling Problem without Capacity Constraints

Author

Listed:
  • Ming-Jong Yao

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. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • Ming-Jong Yao, 2005. "The Economic Lot Scheduling Problem without Capacity Constraints," Annals of Operations Research, Springer, vol. 133(1), pages 193-205, January.
    • Handle: RePEc:spr:annopr:v:133:y:2005:i:1:p:193-205:10.1007/s10479-004-5033-y
    DOI: 10.1007/s10479-004-5033-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-004-5033-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-004-5033-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    2. Narro Lopez, Miguel A. & Kingsman, Brian G., 1991. "The economic lot scheduling problem: theory and practice," International Journal of Production Economics, Elsevier, vol. 23(1-3), pages 147-164, October.
    3. Earl E. Bomberger, 1966. "A Dynamic Programming Approach to a Lot Size Scheduling Problem," Management Science, INFORMS, vol. 12(11), pages 778-784, July.
    4. Samuel G. Davis, 1990. "Scheduling Economic Lot Size Production Runs," Management Science, INFORMS, vol. 36(8), pages 985-998, August.
    5. P. C. Geng & R. G. Vickson, 1988. "Two heuristics for the economic lot scheduling problem: An experimental study," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 605-617, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Holmbom, Martin & Segerstedt, Anders, 2014. "Economic Order Quantities in production: From Harris to Economic Lot Scheduling Problems," International Journal of Production Economics, Elsevier, vol. 155(C), pages 82-90.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brander, Par & Forsberg, Rolf, 2006. "Determination of safety stocks for cyclic schedules with stochastic demands," International Journal of Production Economics, Elsevier, vol. 104(2), pages 271-295, December.
    2. Vidal-Carreras, Pilar I. & Garcia-Sabater, Jose P. & Coronado-Hernandez, Jairo R., 2012. "Economic lot scheduling with deliberated and controlled coproduction," European Journal of Operational Research, Elsevier, vol. 219(2), pages 396-404.
    3. Leven, Erik & Segerstedt, Anders, 2007. "A scheduling policy for adjusting economic lot quantities to a feasible solution," European Journal of Operational Research, Elsevier, vol. 179(2), pages 414-423, June.
    4. Banerjee, Avijit & Pyreddy, Vijay R. & Kim, Seung Lae, 1996. "Investment policy for multiple product setup reduction under budgetary and capacity constraints," International Journal of Production Economics, Elsevier, vol. 45(1-3), pages 321-327, August.
    5. Teunter, Ruud & Tang, Ou & Kaparis, Konstantinos, 2009. "Heuristics for the economic lot scheduling problem with returns," International Journal of Production Economics, Elsevier, vol. 118(1), pages 323-330, March.
    6. Chang, Ping-Teng & Yao, Ming-Jong & Huang, Shih-Fen & Chen, Chia-Tsung, 2006. "A genetic algorithm for solving a fuzzy economic lot-size scheduling problem," International Journal of Production Economics, Elsevier, vol. 102(2), pages 265-288, August.
    7. Khouja, Moutaz & Michalewicz, Zgibniew & Wilmot, Michael, 1998. "The use of genetic algorithms to solve the economic lot size scheduling problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 509-524, November.
    8. Banerjee, Avijit, 2009. "Simultaneous determination of multiproduct batch and full truckload shipment schedules," International Journal of Production Economics, Elsevier, vol. 118(1), pages 111-117, March.
    9. Holmbom, Martin & Segerstedt, Anders, 2014. "Economic Order Quantities in production: From Harris to Economic Lot Scheduling Problems," International Journal of Production Economics, Elsevier, vol. 155(C), pages 82-90.
    10. Khouja, Moutaz, 1997. "The scheduling of economic lot sizes on volume flexible production systems," International Journal of Production Economics, Elsevier, vol. 48(1), pages 73-86, January.
    11. Kirschstein, Thomas, 2018. "Planning of multi-product pipelines by economic lot scheduling models," European Journal of Operational Research, Elsevier, vol. 264(1), pages 327-339.
    12. Lopez de Haro, Santiago & Gershwin, Stanley B. & Rosenfield, Donald B., 2009. "Schedule evaluation in unstable manufacturing environments," International Journal of Production Economics, Elsevier, vol. 121(1), pages 183-194, September.
    13. Guillermo Gallego & Robin Roundy, 1992. "The economic lot scheduling problem with finite backorder costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 729-739, August.
    14. Brander, Par & Leven, Erik & Segerstedt, Anders, 2005. "Lot sizes in a capacity constrained facility--a simulation study of stationary stochastic demand," International Journal of Production Economics, Elsevier, vol. 93(1), pages 375-386, January.
    15. Guillermo Gallego & Ilkyeong Moon, 1995. "Strategic investment to reduce setup times in the economic lot scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 773-790, August.
    16. Hoque, M.A. & Kingsman, B.G., 2006. "Synchronization in common cycle lot size scheduling for a multi-product serial supply chain," International Journal of Production Economics, Elsevier, vol. 103(1), pages 316-331, September.
    17. Sox, Charles R. & Jackson, Peter L. & Bowman, Alan & Muckstadt, John A., 1999. "A review of the stochastic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 62(3), pages 181-200, September.
    18. Salvietti, Luciano & Smith, Neale R., 2008. "A profit-maximizing economic lot scheduling problem with price optimization," European Journal of Operational Research, Elsevier, vol. 184(3), pages 900-914, February.
    19. Daniel Adelman & Christiane Barz, 2014. "A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 374-402, May.
    20. Wagner, Bret J. & Davis, Darwin J., 2002. "A search heuristic for the sequence-dependent economic lot scheduling problem," European Journal of Operational Research, Elsevier, vol. 141(1), pages 133-146, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:133:y:2005:i:1:p:193-205:10.1007/s10479-004-5033-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.