Housekeeping: Foresightful container repositioning
Publication date
2016-06-10
Document type
Forschungsartikel
Author
Ehleiter, Anne
Organisational unit
University of Augsburg
Scopus ID
Publisher
Elsevier
Series or journal
International Journal of Production Economics
ISSN
Periodical volume
179
First page
203
Last page
211
Peer-reviewed
✅
Part of the university bibliography
Nein
Language
English
Keyword
Container terminal
Seaport storage area
Twin cranes
Abstract
This paper deals with crane scheduling in a block of a container terminal equipped with twin cranes when repositioning moves turn out necessary. While one crane is working on a given schedule we aim to anticipate as many repositioning jobs as possible using the second crane without disturbing the first crane. In seaport operations, this situation is commonly called housekeeping. We formulate this problem as a MIP and show that it is strongly NP-hard. Further, we provide an exact procedure based on dynamic programming and a Greedy heuristic procedure to solve it. A comparison of both algorithms with CPLEX concludes this paper.
Version
Published version
Access right on openHSU
Metadata only access