Uli Gollea () (Johannes-Gutenberg-Universität Mainz, Lehrstuhl für Wirtschaftsinformatik und BWL) Nils Boysen () (Friedrich-Schiller-Universität Jena, Lehrstuhl für Operations Management) Franz Rothlauf () (Johannes-Gutenberg-Universität Mainz, Lehrstuhl für Wirtschaftsinformatik und BWL)
Abstract
This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work overloads at the stations of the line by applying so-called sequencing rules, which restrict the maximum occurrence of labor-intensive options in a subsequence of a certain length. Thus to successfully avoid work overloads, suitable sequencing rules are essential. The paper shows that the only existing rule generation approach leads to sequencing rules which misclassify feasible sequences. We present a novel procedure which overcomes this drawback by generating multiple sequencing rules. Then, it is shown how to apply both procedures in case of multiple processing times per station. For both cases analytical and empirical results are derived to compare classification quality.
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: ().