Loading...
Please wait, while we are loading the content...
Similar Documents
Working Papers in Information Systems and Business Administration
| Content Provider | Semantic Scholar |
|---|---|
| Author | Boysen, Nils Golle, Uli Rothlauf, Franz |
| Copyright Year | 2010 |
| Abstract | The car sequencing problem is a widespread short-term decision problem, in which sequences of different car models launched down a mixed-model assembly line are to be determined. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, in a subsequence of a certain length by applying sequencing rules. Existing research invariably assumes that the model sequence can be planned with all degrees of freedom. However, in real-world, the sequence of cars in each department can not be arbitrarily changed but depends on the sequence in previous departments and disturbances like machine breakdowns, rush orders, or material shortages. Therefore, in reality the sequencing problem often turns into a resequencing problem. Here, a given model sequence has to be reshuffled with the help of resequencing buffers (denoted as pull-off tables). This paper formulates the car resequencing problem, where pull-off tables can be used to reshuffle a given initial sequence and rule violations are minimized. The problem is formalized and problem-specific exact and heuristic solution procedures are developed and studied. To speed up search, a lower bound as well as a dominance rule are introduced which both reduce the running time of the solution procedures. Finally, a real-world case study is presented. In comparison to the currently used real-world scheduling approach, the resequencing approach can improve solution quality by on average about 30%. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://wi.bwl.uni-mainz.de/publikationen/WP-01-2010.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
