Department of Economics and Business Economics

Simon Emde

Scheduling in-house transport vehicles to feed parts to automotive assembly lines

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

Standard

Scheduling in-house transport vehicles to feed parts to automotive assembly lines. / Emde, Simon; Gendreau, Michel.

In: European Journal of Operational Research, Vol. 260, No. 1, 01.07.2017, p. 255-267.

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

Harvard

Emde, S & Gendreau, M 2017, 'Scheduling in-house transport vehicles to feed parts to automotive assembly lines', European Journal of Operational Research, vol. 260, no. 1, pp. 255-267. https://doi.org/10.1016/j.ejor.2016.12.012

APA

CBE

MLA

Vancouver

Author

Emde, Simon ; Gendreau, Michel. / Scheduling in-house transport vehicles to feed parts to automotive assembly lines. In: European Journal of Operational Research. 2017 ; Vol. 260, No. 1. pp. 255-267.

Bibtex

@article{e11da325fb6f4b66a6b697f23d8491d9,
title = "Scheduling in-house transport vehicles to feed parts to automotive assembly lines",
abstract = "Due to exorbitant product variety, very limited space, and other factors, organizing efficient and timely deliveries of parts and subassemblies to final assembly within the factory is one of the most pressing problems of modern mixed-model assembly production. Many automobile producers have implemented the so-called “supermarket” concept to transfer material to the assembly line frequently and in small lots. Supermarkets are decentralized logistics areas on the shop floor where parts are intermediately stored for nearby assembly cells, to be ferried there by small transport vehicles (called tow trains or tuggers). This paper tackles the operational problem of drawing up schedules for these tow trains, such that the assembly line never starves for parts while also minimizing in-process inventory, thus satisfying just-in-time goals. We prove strong NP-completeness of the problem and present exact and heuristic solution methods. In a computational study, the procedures are shown to perform very well, solving realistic instances to (near-)optimality in a matter of minutes, clearly outperforming the simple cyclic schedules commonly used in industrial practice. We also provide some managerial insight into the right degree of automation for such a part feeding system.",
keywords = "Just-in-time, Mixed-model assembly lines, Production logistics, Scheduling, Tow trains",
author = "Simon Emde and Michel Gendreau",
year = "2017",
month = jul,
day = "1",
doi = "10.1016/j.ejor.2016.12.012",
language = "English",
volume = "260",
pages = "255--267",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier BV",
number = "1",

}

RIS

TY - JOUR

T1 - Scheduling in-house transport vehicles to feed parts to automotive assembly lines

AU - Emde, Simon

AU - Gendreau, Michel

PY - 2017/7/1

Y1 - 2017/7/1

N2 - Due to exorbitant product variety, very limited space, and other factors, organizing efficient and timely deliveries of parts and subassemblies to final assembly within the factory is one of the most pressing problems of modern mixed-model assembly production. Many automobile producers have implemented the so-called “supermarket” concept to transfer material to the assembly line frequently and in small lots. Supermarkets are decentralized logistics areas on the shop floor where parts are intermediately stored for nearby assembly cells, to be ferried there by small transport vehicles (called tow trains or tuggers). This paper tackles the operational problem of drawing up schedules for these tow trains, such that the assembly line never starves for parts while also minimizing in-process inventory, thus satisfying just-in-time goals. We prove strong NP-completeness of the problem and present exact and heuristic solution methods. In a computational study, the procedures are shown to perform very well, solving realistic instances to (near-)optimality in a matter of minutes, clearly outperforming the simple cyclic schedules commonly used in industrial practice. We also provide some managerial insight into the right degree of automation for such a part feeding system.

AB - Due to exorbitant product variety, very limited space, and other factors, organizing efficient and timely deliveries of parts and subassemblies to final assembly within the factory is one of the most pressing problems of modern mixed-model assembly production. Many automobile producers have implemented the so-called “supermarket” concept to transfer material to the assembly line frequently and in small lots. Supermarkets are decentralized logistics areas on the shop floor where parts are intermediately stored for nearby assembly cells, to be ferried there by small transport vehicles (called tow trains or tuggers). This paper tackles the operational problem of drawing up schedules for these tow trains, such that the assembly line never starves for parts while also minimizing in-process inventory, thus satisfying just-in-time goals. We prove strong NP-completeness of the problem and present exact and heuristic solution methods. In a computational study, the procedures are shown to perform very well, solving realistic instances to (near-)optimality in a matter of minutes, clearly outperforming the simple cyclic schedules commonly used in industrial practice. We also provide some managerial insight into the right degree of automation for such a part feeding system.

KW - Just-in-time

KW - Mixed-model assembly lines

KW - Production logistics

KW - Scheduling

KW - Tow trains

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

U2 - 10.1016/j.ejor.2016.12.012

DO - 10.1016/j.ejor.2016.12.012

M3 - Journal article

AN - SCOPUS:85008173503

VL - 260

SP - 255

EP - 267

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -