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

The Dynamic Line Allocation Problem

Author

Listed:
  • Reza H. Ahmadi

    (Anderson Graduate School of Management, University of California, Los Angeles, Los Angeles, California 90024)

  • Sriram Dasu

    (Anderson Graduate School of Management, University of California, Los Angeles, Los Angeles, California 90024)

  • Christopher S. Tang

    (Anderson Graduate School of Management, University of California, Los Angeles, Los Angeles, California 90024)

Abstract

Consider a plant that has information about the arrival schedule of its "inputs" over a planning cycle. The plant has parallel production lines for processing multiple types of products. However, changeover cost and changeover time are incurred when a line changes from processing one type of products to a different type of products. We present a dynamic line allocation problem that determines an optimal line allocation so that the total relevant cost (changeover and waiting costs) is minimized. In this paper we analyze the complexity of the problem and develop three different heuristics for generating near-optimal allocations.

Suggested Citation

  • Reza H. Ahmadi & Sriram Dasu & Christopher S. Tang, 1992. "The Dynamic Line Allocation Problem," Management Science, INFORMS, vol. 38(9), pages 1341-1353, September.
    • Handle: RePEc:inm:ormnsc:v:38:y:1992:i:9:p:1341-1353
    DOI: 10.1287/mnsc.38.9.1341
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.38.9.1341
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.38.9.1341?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. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    3. Raf Jans, 2009. "Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 123-136, February.
    4. van Zante-de Fokkert, Jannet I. & de Kok, Ton G., 1997. "The mixed and multi model line balancing problem: a comparison," European Journal of Operational Research, Elsevier, vol. 100(3), pages 399-412, August.
    5. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    6. Sternatz, Johannes, 2014. "Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry," European Journal of Operational Research, Elsevier, vol. 235(3), pages 740-754.
    7. Jans, R.F., 2006. "Solving Lotsizing Problems on Parallel Identical Machines Using Symmetry Breaking Constraints," ERIM Report Series Research in Management ERS-2006-051-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:38:y:1992:i:9:p:1341-1353. 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.