Document Actions
Citation and Metadata
Recommended citation
Boysen N, Golle U, Rothlauf F (2011). The Car Resequencing Problem with Pull-Off Tables. BuR - Business Research, Vol. 4, Iss. 2, pp. 276-292, URN: urn:nbn:de:0009-20-32115
Download Citation
Endnote
%0 Journal Article %T The Car Resequencing Problem with Pull-Off Tables %A Boysen, Nils %A Golle, Uli %A Rothlauf, Franz %J BuR - Business Research %D 2011 %V 4 %N 2 %@ 1866-8658 %F boysen2011 %X The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated. %L 330 %K car sequencing %K mixed-model assembly line %K resequencing %U http://nbn-resolving.de/urn:nbn:de:0009-20-32115 %P 276-292
Bibtex
@Article{boysen2011,
author = "Boysen, Nils
and Golle, Uli
and Rothlauf, Franz",
title = "The Car Resequencing Problem with Pull-Off Tables",
journal = "BuR - Business Research",
year = "2011",
volume = "4",
number = "2",
pages = "276--292",
keywords = "car sequencing",
keywords = "mixed-model assembly line",
keywords = "resequencing",
abstract = "The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.",
issn = "1866-8658",
url = "http://nbn-resolving.de/urn:nbn:de:0009-20-32115"
}
RIS
TY - JOUR AU - Boysen, Nils AU - Golle, Uli AU - Rothlauf, Franz PY - 2011// TI - The Car Resequencing Problem with Pull-Off Tables JO - BuR - Business Research SP - 276 EP - 292 VL - 4 IS - 2 KW - car sequencing KW - mixed-model assembly line KW - resequencing N2 - The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated. SN - 1866-8658 UR - http://nbn-resolving.de/urn:nbn:de:0009-20-32115 ID - boysen2011 ER -
Wordbib
<?xml version="1.0" encoding="UTF-8"?> <b:Sources SelectedStyle="" xmlns:b="http://schemas.openxmlformats.org/officeDocument/2006/bibliography" xmlns="http://schemas.openxmlformats.org/officeDocument/2006/bibliography" > <b:Source> <b:Tag>boysen2011</b:Tag> <b:SourceType>ArticleInAPeriodical</b:SourceType> <b:Year>2011</b:Year> <b:PeriodicalName>BuR - Business Research</b:PeriodicalName> <b:Volume>4</b:Volume> <b:Issue>2</b:Issue> <b:Pages>276-292</b:Pages> <b:Author> <b:Author><b:NameList> <b:Person><b:Last>Boysen</b:Last><b:First>Nils</b:First></b:Person> <b:Person><b:Last>Golle</b:Last><b:First>Uli</b:First></b:Person> <b:Person><b:Last>Rothlauf</b:Last><b:First>Franz</b:First></b:Person> </b:NameList></b:Author> </b:Author> <b:Title>The Car Resequencing Problem with Pull-Off Tables</b:Title> <b:Comments>The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.</b:Comments> </b:Source> </b:Sources>
ISI
PT Journal AU Boysen, N Golle, U Rothlauf, F TI The Car Resequencing Problem with Pull-Off Tables SO BuR - Business Research PY 2011 BP 276 EP 292 VL 4 IS 2 DE car sequencing; mixed-model assembly line; resequencing AB The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated. ER
Mods
<mods>
<titleInfo>
<title>The Car Resequencing Problem with Pull-Off Tables</title>
</titleInfo>
<name type="personal">
<namePart type="family">Boysen</namePart>
<namePart type="given">Nils</namePart>
</name>
<name type="personal">
<namePart type="family">Golle</namePart>
<namePart type="given">Uli</namePart>
</name>
<name type="personal">
<namePart type="family">Rothlauf</namePart>
<namePart type="given">Franz</namePart>
</name>
<abstract>The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.</abstract>
<subject>
<topic>car sequencing</topic>
<topic>mixed-model assembly line</topic>
<topic>resequencing</topic>
</subject>
<classification authority="ddc">330</classification>
<relatedItem type="host">
<genre authority="marcgt">periodical</genre>
<genre>academic journal</genre>
<titleInfo>
<title>BuR - Business Research</title>
</titleInfo>
<part>
<detail type="volume">
<number>4</number>
</detail>
<detail type="issue">
<number>2</number>
</detail>
<date>2011</date>
<extent unit="page">
<start>276</start>
<end>292</end>
</extent>
</part>
</relatedItem>
<identifier type="issn">1866-8658</identifier>
<identifier type="urn">urn:nbn:de:0009-20-32115</identifier>
<identifier type="uri">http://nbn-resolving.de/urn:nbn:de:0009-20-32115</identifier>
<identifier type="citekey">boysen2011</identifier>
</mods>
Full Metadata
| Bibliographic Citation | BuR - Business Research, Vol. 4, Iss. 2, pp. 276-292 |
|---|---|
| Title | The Car Resequencing Problem with Pull-Off Tables (eng) |
| Author | Nils Boysen, Uli Golle, Franz Rothlauf |
| Language | eng |
| Abstract | The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated. |
| Subject | car sequencing, mixed-model assembly line, resequencing |
| DDC | 330 |
| Rights | authorcontract |
| URN: | urn:nbn:de:0009-20-32115 |
