Level Scheduling of Mixed-Model Assembly Lines under Storage Constraints
In a mixed-model assembly line dierent models of a common base product can be manufactured in intermixed production sequences. A famous solution approach for the resulting short-term sequencing problem is the so called level scheduling problem, which aims at evenly smoothing the material requirements over time in order to facilitate a just-in-time supply. However, if materials are delivered in discrete quantities, the resulting spreading of material usages implies that issued cargo carriers of a respective material remain at a station for a longer period of time. In practical applications with plenty materials required per station, this procedure might lead to bottlenecks with respect to the scarce storage space at stations. This paper investigates level scheduling under the constraint that the induced part usage patterns may not violate given storage constraints. The resulting sequencing problem is formalized and solved by suited exact and heuristic solution approaches.
|Date of creation:||29 May 2007|
|Date of revision:|
|Publication status:||Published in: International Journal of Production Research 47/10 (2009), 2669-2684|
|Contact details of provider:|| Postal: Carl-Zeiss-Strasse 3, 07743 JENA|
Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page: http://www.wiwiss.uni-jena.de/index.html
More information through EDIRC
|Order Information:|| Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.|
When requesting a correction, please mention this item's handle: RePEc:jen:jenjbe:2007-09. 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: ()
If references are entirely missing, you can add them using this form.