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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
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.
For technical questions regarding this item, or to correct its listing, contact: ().
Cited by: (explanations, 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.)