IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v36y1990i8p985-998.html
   My bibliography  Save this article

Scheduling Economic Lot Size Production Runs

Author

Listed:
  • Samuel G. Davis

    (College of Business Administration, Pennsylvania State University, University Park, Pennsylvania 16802)

Abstract

Single capacitated production facilities where multiple products are produced pose particularly challenging scheduling problems. The traditional economic lot size calculation reflects the optimum production batch size in the light of the tradeoff between inventory carrying costs and order preparation/setup costs. However, these calculations are straightforward only when applied to a single product. When multiple products are produced on the same facility, the production quantities must be translated into a schedule which is within the capacity of the facility and results in the timely satisfaction of demand for each product. Previously published solution procedures directly address the capacity issue. A far less tractable issue is the stockout concern. This issue has previously been addressed by either (1) imposing (often overly restrictive) constraints a priori to guarantee feasibility from the outset possibly eliminating more economic schedule alternatives from consideration or (2) heuristic enumeration procedures where trial solutions are evaluated for feasibility a posteriori but the escape from infeasibility often poses algorithmic difficulties. In this paper, the focus is on providing a workable production sequence through a posteriori tests. Mathematical programming approaches are defined which include alternative formulations to better address the stockout concern. Goal programming procedures are proposed which provide a mechanism to directly examine the tradeoffs between scheduling efficiency and delivery performance.

Suggested Citation

  • Samuel G. Davis, 1990. "Scheduling Economic Lot Size Production Runs," Management Science, INFORMS, vol. 36(8), pages 985-998, August.
  • Handle: RePEc:inm:ormnsc:v:36:y:1990:i:8:p:985-998
    DOI: 10.1287/mnsc.36.8.985
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.36.8.985
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.36.8.985?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
    ---><---

    Citations

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


    Cited by:

    1. Ming-Jong Yao, 2005. "The Economic Lot Scheduling Problem without Capacity Constraints," Annals of Operations Research, Springer, vol. 133(1), pages 193-205, January.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    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. 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.

    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:inm:ormnsc:v:36:y:1990:i:8:p:985-998. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.