IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v69y1997i0p241-25910.1023-a1018985029260.html
   My bibliography  Save this article

Optimal level schedules for mixed-model, multi-level just-in-time assembly systems

Author

Listed:
  • Wieslaw Kubiak
  • George Steiner
  • Julian Scott Yeomans

Abstract

Solving the level (or balanced) schedule problem is the most important scheduling goal for just-in-time production assembly systems. No previous methods have been presented for determining optimal balanced schedules in multi-level facilities. In this paper, it is shown that the multi-level, min-max problem is NP-hard in the strong sense. A dynamic programming algorithm (DP) is developed for both the min-max and min-sum problems which, for the first time, permits optimal schedules to be determined for large, multi-level problems. The time and space requirements of the DP are analyzed and several techniques for reducing the DP's computational requirements are described. A filtering scheme is proposed to eliminate dominated solutions from a problem's potentially vast state space. Extensive computational testing of the min-max algorithm is reported and the conclusions from this testing are presented. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Wieslaw Kubiak & George Steiner & Julian Scott Yeomans, 1997. "Optimal level schedules for mixed-model, multi-level just-in-time assembly systems," Annals of Operations Research, Springer, vol. 69(0), pages 241-259, January.
    • Handle: RePEc:spr:annopr:v:69:y:1997:i:0:p:241-259:10.1023/a:1018985029260
    DOI: 10.1023/A:1018985029260
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018985029260
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018985029260?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.

    Citations

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


    Cited by:

    1. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    2. Zhu, Jin & Ding, Fong-Yuen, 2000. "A transformed two-stage method for reducing the part-usage variation and a comparison of the product-level and part-level solutions in sequencing mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 127(1), pages 203-216, November.
    3. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "Sequencing mixed-model assembly lines: Survey, classification and model critique," European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
    4. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "The product rate variation problem and its relevance in real world mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 197(2), pages 818-824, September.
    5. Mansouri, S. Afshin, 2005. "A Multi-Objective Genetic Algorithm for mixed-model sequencing on JIT assembly lines," European Journal of Operational Research, Elsevier, vol. 167(3), pages 696-716, December.
    6. Aigbedo, Henry, 2007. "An assessment of the effect of mass customization on suppliers' inventory levels in a JIT supply chain," European Journal of Operational Research, Elsevier, vol. 181(2), pages 704-715, September.
    7. Amogh Bhosekar & Sandra Ekşioğlu & Tuğçe Işık & Robert Allen, 2023. "A discrete event simulation model for coordinating inventory management and material handling in hospitals," Annals of Operations Research, Springer, vol. 320(2), pages 603-630, January.
    8. Drexl, Andreas & Kimms, Alf, 1999. "Belastungsorientierte Just-in-Time Variantenfließfertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 502, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Vergauwen, P.G.M.C. & Busser, K. & Rongen, P. & Verwaijen, R. & Vossen, D.J.L.H., 2001. "Cost accounting and pricing improvement at Helmond Print: using Xeikon digital colour printing equipment: a case study," Research Memorandum 028, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    10. Drexl, Andreas & Kimms, Alf, 1997. "Sequencing JIT mixed-model assembly lines under station load- and part usage-constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 460, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    More about this item

    Statistics

    Access and download statistics

    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:69:y:1997:i:0:p:241-259:10.1023/a:1018985029260. 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: 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.