Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
Wieslaw Kubiak,
George Steiner and
Julian Scott Yeomans
Annals of Operations Research, 1997, vol. 69, issue 0, 259 pages
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
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (10)
Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018985029260 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:69:y:1997:i:0:p:241-259:10.1023/a:1018985029260
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1023/A:1018985029260
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().