Department of Economics and Business Economics

You are here: Department of Economics and Business Economics » Simon Emde » Research outputs » Scheduling trucks on factory premises

Simon Emde

Scheduling trucks on factory premises

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Standard

Scheduling trucks on factory premises. / Wirth, Martin; Emde, Simon.

In: Computers and Industrial Engineering, Vol. 126, 01.12.2018, p. 175-186.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Harvard

Wirth, M & Emde, S 2018, 'Scheduling trucks on factory premises', Computers and Industrial Engineering, vol. 126, pp. 175-186. https://doi.org/10.1016/j.cie.2018.09.023

APA

Wirth, M., & Emde, S. (2018). Scheduling trucks on factory premises. Computers and Industrial Engineering, 126, 175-186. https://doi.org/10.1016/j.cie.2018.09.023

CBE

Wirth M, Emde S. 2018. Scheduling trucks on factory premises. Computers and Industrial Engineering. 126:175-186. https://doi.org/10.1016/j.cie.2018.09.023

MLA

Wirth, Martin and Simon Emde. "Scheduling trucks on factory premises". Computers and Industrial Engineering. 2018, 126. 175-186. https://doi.org/10.1016/j.cie.2018.09.023

Vancouver

Wirth M, Emde S. Scheduling trucks on factory premises. Computers and Industrial Engineering. 2018 Dec 1;126:175-186. https://doi.org/10.1016/j.cie.2018.09.023

Author

Wirth, Martin ; Emde, Simon. / Scheduling trucks on factory premises. In: Computers and Industrial Engineering. 2018 ; Vol. 126. pp. 175-186.

Bibtex

@article{c12d2160043a461fb3d62be4c88f86cb,
title = "Scheduling trucks on factory premises",
abstract = "Trucks carrying just-in-time parts for assembly plants need to be processed on the factory premises in a speedy manner to guarantee smooth operations, improve supply chain performance, and avoid demurrages. Traditionally, plant managers and logistics providers have long been dissatisfied with extensive waiting times and severe on-site congestion. In this context, we tackle the problem of scheduling a set of trucks arriving at an assembly plant to deliver parts to specific dock doors on the factory premises. Trucks must visit a given set of doors, and they have individual arrival and due dates. They should be scheduled such that the total weighted tardiness is minimal. We propose a mixed-integer programming model and develop bounding procedures and heuristics, which are shown to perform well in a computational study, yielding small optimality gaps in under a minute of runtime. Our tests also reveal that door assignment and time window management have a substantial impact on on-premise congestion.",
keywords = "Factory premises, GRASP, Just-in-time logistics, Open shop scheduling, Weighted tardiness",
author = "Martin Wirth and Simon Emde",
year = "2018",
month = dec,
day = "1",
doi = "10.1016/j.cie.2018.09.023",
language = "English",
volume = "126",
pages = "175--186",
journal = "Computers & Industrial Engineering",
issn = "0360-8352",
publisher = "Pergamon Press",

}

RIS

TY - JOUR

T1 - Scheduling trucks on factory premises

AU - Wirth, Martin

AU - Emde, Simon

PY - 2018/12/1

Y1 - 2018/12/1

N2 - Trucks carrying just-in-time parts for assembly plants need to be processed on the factory premises in a speedy manner to guarantee smooth operations, improve supply chain performance, and avoid demurrages. Traditionally, plant managers and logistics providers have long been dissatisfied with extensive waiting times and severe on-site congestion. In this context, we tackle the problem of scheduling a set of trucks arriving at an assembly plant to deliver parts to specific dock doors on the factory premises. Trucks must visit a given set of doors, and they have individual arrival and due dates. They should be scheduled such that the total weighted tardiness is minimal. We propose a mixed-integer programming model and develop bounding procedures and heuristics, which are shown to perform well in a computational study, yielding small optimality gaps in under a minute of runtime. Our tests also reveal that door assignment and time window management have a substantial impact on on-premise congestion.

AB - Trucks carrying just-in-time parts for assembly plants need to be processed on the factory premises in a speedy manner to guarantee smooth operations, improve supply chain performance, and avoid demurrages. Traditionally, plant managers and logistics providers have long been dissatisfied with extensive waiting times and severe on-site congestion. In this context, we tackle the problem of scheduling a set of trucks arriving at an assembly plant to deliver parts to specific dock doors on the factory premises. Trucks must visit a given set of doors, and they have individual arrival and due dates. They should be scheduled such that the total weighted tardiness is minimal. We propose a mixed-integer programming model and develop bounding procedures and heuristics, which are shown to perform well in a computational study, yielding small optimality gaps in under a minute of runtime. Our tests also reveal that door assignment and time window management have a substantial impact on on-premise congestion.

KW - Factory premises

KW - GRASP

KW - Just-in-time logistics

KW - Open shop scheduling

KW - Weighted tardiness

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

U2 - 10.1016/j.cie.2018.09.023

DO - 10.1016/j.cie.2018.09.023

M3 - Journal article

AN - SCOPUS:85053773763

VL - 126

SP - 175

EP - 186

JO - Computers & Industrial Engineering

JF - Computers & Industrial Engineering

SN - 0360-8352

ER -