IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v38y1990i6p1079-1088.html
   My bibliography  Save this article

Testing Feasibility in a Lot Scheduling Problem

Author

Listed:
  • Edward J. Anderson

    (Cambridge University, Cambridge, England)

Abstract

In this paper, we consider a version of the Economic Lot Scheduling Problem in which there are no costs specified. The usual form of this problem seeks a pattern of production that minimizes the sum of holding the setup costs. We investigate the problem of finding a feasible schedule which avoids a stockout given the initial stocks of the products being manufactured. It is shown that this problem is NP-hard, and an effective heuristic method for its solution is proposed. This heuristic method is compared with a more naive approach to the problem and some computational results are given.

Suggested Citation

  • Edward J. Anderson, 1990. "Testing Feasibility in a Lot Scheduling Problem," Operations Research, INFORMS, vol. 38(6), pages 1079-1088, December.
    • Handle: RePEc:inm:oropre:v:38:y:1990:i:6:p:1079-1088
    DOI: 10.1287/opre.38.6.1079
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.38.6.1079
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.38.6.1079?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. Ramesh Bollapragada & Uday Rao, 1999. "Single-Stage Resource Allocation and Economic Lot Scheduling on Multiple, Nonidentical Production Lines," Management Science, INFORMS, vol. 45(6), pages 889-904, June.
    2. 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.

    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:oropre:v:38:y:1990:i:6:p:1079-1088. 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.