Analysis and design of sequencing rules for car sequencing
AbstractThis 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 InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Friedrich-Schiller-University Jena, School of Economics and Business Administration in its series Jena Research Papers in Business and Economics - Working and Discussion Papers with number 09/2009.
Date of creation: 27 Apr 2009
Date of revision:
Publication status: Published in: European Journal of Operational Research 206 (2010), 579-585.
Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-05-02 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.