IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Single-Stage Resource Allocation and Economic Lot Scheduling on Multiple, Nonidentical Production Lines

Listed author(s):
  • Ramesh Bollapragada

    (Bell Laboratories, Lucent Technologies, Room 2L-515, 101 Crawfords Corner Road, Holmdel, New Jersey 07733)

  • Uday Rao

    (Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213)

Registered author(s):

    This paper focuses on simultaneous resource allocation, lot-sizing, and scheduling in a multimachine, deterministic ELSP environment. We consider the problem of apportioning item production to distinct manufacturing lines with different costs and capabilities (production rates). The objective is to minimize the long-run average production, setup, inventory, and shortage penalty costs (due to lost sales). Restricting attention to rotation schedules, we develop a concave minimization model of the problem, generate heuristic solutions and a lower bound on the cost of any feasible solution. Computational experiments indicate that our heuristic solution is within a few percent of the lower bound. We also investigate sensitivity of costs to model parameters, and illustrate how our model may be used to determine target values for equipment utilization.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 45 (1999)
    Issue (Month): 6 (June)
    Pages: 889-904

    in new window

    Handle: RePEc:inm:ormnsc:v:45:y:1999:i:6:p:889-904
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    1. Jose Juan Carreno, 1990. "Economic Lot Scheduling for Multiple Products on Parallel Identical Processors," Management Science, INFORMS, vol. 36(3), pages 348-358, March.
    2. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    3. Wen-Lian Hsu, 1983. "On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine," Management Science, INFORMS, vol. 29(1), pages 93-105, January.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:6:p:889-904. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.