@article{ART001175757},
author={Junha Hwang},
title={An Iterative Improvement search for the Optimal Berth and crane Scheduling},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2004},
volume={9},
number={4},
pages={117-125}
TY - JOUR
AU - Junha Hwang
TI - An Iterative Improvement search for the Optimal Berth and crane Scheduling
JO - Journal of The Korea Society of Computer and Information
PY - 2004
VL - 9
IS - 4
PB - The Korean Society Of Computer And Information
SP - 117
EP - 125
SN - 1598-849X
AB - The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship, determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which all the constraints should be satisfied. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible, while the operation cost of the terminal should be minimized. In this paper, I present an effective approach to solving this problem, which combines both constraint satisfaction search and iterative improvement search. I test this method on a real world container terminal problem and the results show that the method can produce better results than any other existing method.
KW -
DO -
UR -
ER -
Junha Hwang. (2004). An Iterative Improvement search for the Optimal Berth and crane Scheduling. Journal of The Korea Society of Computer and Information, 9(4), 117-125.
Junha Hwang. 2004, "An Iterative Improvement search for the Optimal Berth and crane Scheduling", Journal of The Korea Society of Computer and Information, vol.9, no.4 pp.117-125.
Junha Hwang "An Iterative Improvement search for the Optimal Berth and crane Scheduling" Journal of The Korea Society of Computer and Information 9.4 pp.117-125 (2004) : 117.
Junha Hwang. An Iterative Improvement search for the Optimal Berth and crane Scheduling. 2004; 9(4), 117-125.
Junha Hwang. "An Iterative Improvement search for the Optimal Berth and crane Scheduling" Journal of The Korea Society of Computer and Information 9, no.4 (2004) : 117-125.
Junha Hwang. An Iterative Improvement search for the Optimal Berth and crane Scheduling. Journal of The Korea Society of Computer and Information, 9(4), 117-125.
Junha Hwang. An Iterative Improvement search for the Optimal Berth and crane Scheduling. Journal of The Korea Society of Computer and Information. 2004; 9(4) 117-125.
Junha Hwang. An Iterative Improvement search for the Optimal Berth and crane Scheduling. 2004; 9(4), 117-125.
Junha Hwang. "An Iterative Improvement search for the Optimal Berth and crane Scheduling" Journal of The Korea Society of Computer and Information 9, no.4 (2004) : 117-125.
