Department of Economics and Business Economics

Simon Emde

Sequencing assembly lines to facilitate synchronized just-in-time part supply

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Standard

Sequencing assembly lines to facilitate synchronized just-in-time part supply. / Emde, Simon; Polten, Lukas.

In: Journal of Scheduling, Vol. 22, No. 6, 01.01.2019, p. 607-621.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Harvard

APA

CBE

MLA

Vancouver

Author

Emde, Simon ; Polten, Lukas. / Sequencing assembly lines to facilitate synchronized just-in-time part supply. In: Journal of Scheduling. 2019 ; Vol. 22, No. 6. pp. 607-621.

Bibtex

@article{895fefd135da4c06b135ef3aef141a84,
title = "Sequencing assembly lines to facilitate synchronized just-in-time part supply",
abstract = "The problem of sequencing assembly lines consists of determining the order in which a given set of products is launched down the line. Since individual products may require different parts in different quantities, the production sequence has a big influence on line-side inventory. Classically, sequences are often optimized with the goal of attaining level schedules, i.e., the part demand should be smooth during the planning horizon. However, this approach does not necessarily work well if parts are delivered at discrete points in time in bulk quantities. In this paper, we consider a production system where bins of parts are delivered periodically by a tow train from a central depot at fixed times. Due to the limited space at the assembly line, the maximum number of bins in stock at any time at any station should be minimal. We propose an exact solution method based on combinatorial Benders decomposition as well as bounding procedures and heuristics for this problem. The algorithms are shown to perform well both on instances from the literature and on new data sets. We also investigate whether classic level scheduling methods are effective at reducing line-side stock in an assembly system supplied by tow train, and to what degree line-side stock can be traded off for more frequent deliveries.",
keywords = "Assembly line sequencing, Benders decomposition, Level scheduling, Tow trains",
author = "Simon Emde and Lukas Polten",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/s10951-019-00606-w",
language = "English",
volume = "22",
pages = "607--621",
journal = "Journal of Scheduling",
issn = "1094-6136",
publisher = "Springer New York",
number = "6",

}

RIS

TY - JOUR

T1 - Sequencing assembly lines to facilitate synchronized just-in-time part supply

AU - Emde, Simon

AU - Polten, Lukas

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The problem of sequencing assembly lines consists of determining the order in which a given set of products is launched down the line. Since individual products may require different parts in different quantities, the production sequence has a big influence on line-side inventory. Classically, sequences are often optimized with the goal of attaining level schedules, i.e., the part demand should be smooth during the planning horizon. However, this approach does not necessarily work well if parts are delivered at discrete points in time in bulk quantities. In this paper, we consider a production system where bins of parts are delivered periodically by a tow train from a central depot at fixed times. Due to the limited space at the assembly line, the maximum number of bins in stock at any time at any station should be minimal. We propose an exact solution method based on combinatorial Benders decomposition as well as bounding procedures and heuristics for this problem. The algorithms are shown to perform well both on instances from the literature and on new data sets. We also investigate whether classic level scheduling methods are effective at reducing line-side stock in an assembly system supplied by tow train, and to what degree line-side stock can be traded off for more frequent deliveries.

AB - The problem of sequencing assembly lines consists of determining the order in which a given set of products is launched down the line. Since individual products may require different parts in different quantities, the production sequence has a big influence on line-side inventory. Classically, sequences are often optimized with the goal of attaining level schedules, i.e., the part demand should be smooth during the planning horizon. However, this approach does not necessarily work well if parts are delivered at discrete points in time in bulk quantities. In this paper, we consider a production system where bins of parts are delivered periodically by a tow train from a central depot at fixed times. Due to the limited space at the assembly line, the maximum number of bins in stock at any time at any station should be minimal. We propose an exact solution method based on combinatorial Benders decomposition as well as bounding procedures and heuristics for this problem. The algorithms are shown to perform well both on instances from the literature and on new data sets. We also investigate whether classic level scheduling methods are effective at reducing line-side stock in an assembly system supplied by tow train, and to what degree line-side stock can be traded off for more frequent deliveries.

KW - Assembly line sequencing

KW - Benders decomposition

KW - Level scheduling

KW - Tow trains

UR - http://www.scopus.com/inward/record.url?scp=85064224999&partnerID=8YFLogxK

U2 - 10.1007/s10951-019-00606-w

DO - 10.1007/s10951-019-00606-w

M3 - Journal article

AN - SCOPUS:85064224999

VL - 22

SP - 607

EP - 621

JO - Journal of Scheduling

JF - Journal of Scheduling

SN - 1094-6136

IS - 6

ER -