@inproceedings{78d1e89337a144d3a0786dac69f0bab0,
title = "Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead",
abstract = "This paper studies an online over-list model of the integrated allocation of berths and quay cranes in container terminals with 1-lookahead ability. The objective is to minimize the maximum completion time of container vessels, i.e., the makespan. We focus on two different types of vessels, three berths and a small number of QCs in the hybrid berth layout, with 1-lookahead information. We propose a (1 + √2)/2-competitive algorithm for the case with 4 cranes and a 5/4-competitive algorithm for the case with 5 cranes, respectively. Both of the algorithms are proved to be optimal.",
keywords = "Container terminal, Lookahead information, Online algorithm, Scheduling",
author = "Jiayin Pan and Yinfeng Xu",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 21st International Conference on Computing and Combinatorics Conference, COCOON 2015 ; Conference date: 04-08-2015 Through 06-08-2015",
year = "2015",
doi = "10.1007/978-3-319-21398-9\_32",
language = "英语",
isbn = "9783319213972",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "402--416",
editor = "Dachuan Xu and Donglei Du and Dingzhu Du",
booktitle = "Computing and Combinatorics - 21st International Conference, COCOON 2015, Proceedings",
}