Full Text:
<2744>
CLC number: TP29
On-line Access:
Received: 2004-12-23
Revision Accepted: 2005-04-13
Crosschecked: 0000-00-00
Cited: 2
Clicked: 5868
An integrated approach for modeling and solving the scheduling problem of container handling systems
| |||||||||||||
Chen Lu, Xi Li-feng, Cai Jian-guo, Bostel Nathalie, Dejax Pierre. An integrated approach for modeling and solving the scheduling problem of container handling systems[J]. Journal of Zhejiang University Science A, 2006, 7(2): 234-239.
@article{title="An integrated approach for modeling and solving the scheduling problem of container handling systems",
author="Chen Lu, Xi Li-feng, Cai Jian-guo, Bostel Nathalie, Dejax Pierre",
journal="Journal of Zhejiang University Science A",
volume="7",
number="2",
pages="234-239",
year="2006",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2006.A0234"
}
%0 Journal Article
%T An integrated approach for modeling and solving the scheduling problem of container handling systems
%A Chen Lu
%A Xi Li-feng
%A Cai Jian-guo
%A Bostel Nathalie
%A Dejax Pierre
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 2
%P 234-239
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.A0234
TY - JOUR
T1 - An integrated approach for modeling and solving the scheduling problem of container handling systems
A1 - Chen Lu
A1 - Xi Li-feng
A1 - Cai Jian-guo
A1 - Bostel Nathalie
A1 - Dejax Pierre
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 2
SP - 234
EP - 239
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.A0234
Abstract: An integrated model is presented to schedule the container handling system. The objective is to improve the cooperation between different types of equipments, and to increase the productivity of the terminal. The problem is formulated as a hybrid flow shop scheduling problem with precedence constraint, setup times and blocking (HFSS-B). A tabu search algorithm is proposed to solve this problem. The quality and efficiency of the proposed algorithm is analyzed from the computational point of view.
[1] Bose, J., Reiners, T., Steenken, D., 2000. Vehicle Dispatching at Seaport Container Terminal Using Evolutionary Algorithm. Proceedings of the 33rd Hawaii International Conference on System Science, p.1-10.
[2] Chen, L., Bostel, N., Dejax, P., Cai, J., Xi, L., 2004. Heuristiques Pour le Problème D’ordonnancement Intégré des Équipements de Manutention de Conteneurs dans un Terminal Maritime. Proceedings de la 5e conférence francophone de modélisation et simulation, France, p.1089-1095 (in French).
[3] Dell’Amico, M., Trubian, M., 1993. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41(3):231-252.
[4] Glover, F., 1989. Tabu search part I. ORSA Journal on Computing, 1:190-206.
[5] Glover, F., 1990. Tabu search part II. ORSA Journal on Computing, 2:4-32.
[6] James, A.P., Howard, J.M., Basilotto, J.P., Harbottle, H., 1997. Megaports and Load Centers of the Future with the Port of Houston as the Baseline Port. Research Report, Texas A&M University.
[7] Kim, K.H., Kim, K.Y., 1999a. Routing straddle carriers for the loading operation of containers using a beam search algorithm. Computers & Industrial Engineering, 36(1):109-136.
[8] Kim, K.H., Kim, K.Y., 1999b. A routing algorithm for a single straddle carrier to load export containers onto a containership. International Journal of Production Economics, 59(1-3):425-433.
[9] Kim, K.H., Kim, K.Y., 1999c. An optimal routing algorithm for a transfer crane in port container terminals. Transportation Science, 33:17-33.
[10] Kim, K.H., Park, Y., 2004. A crane scheduling method for port container terminals. European Journal of Operational Research, 156(3):752-768.
[11] Low, C.Y., 2005. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers & Operations Research, 32(8):2013-2026.
[12] Meersmans, P.J.M., 2002. Optimization of Container Handling Systems. Ph.D Thesis, Tinbergen Institute 271, Erasmus University Rotterdam.
[13] Negenman, E.G., 2001. Local search algorithms for the multiprocessor flow shop scheduling problem. European Journal of Operational Research, 128(1):147-158.
[14] Nowicki, E., Smutnicki, C., 1998. The flow shop with parallel machines: a tabu search approach. European Journal of Operational Research, 106(2-3):226-253.
[15] Pinedo, M., 2002. Scheduling Theory, Algorithms, and Systems, 2nd Edition. Prentice Hall, New Jersey.
[16] Santos, D.L., Hunsucker, J.L., Deal, D.E., 1995. Global lower bounds for flow shops with multiple processors. European Journal of Operational Research, 80(1):112-120.
[17] Taillard, E.D., 1994. Parallel taboo search techniques for the job-shop scheduling problem. ORSA Journal on Computing, 6(2):108-117.
[18] Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K., 1992. Job shop scheduling by simulated annealing. Operations Research, 40(1):113-125.
[19] Vigo, D., Toth, P., 2002. The Vehicle Routing Problem. Philadelphia, USA.
[20] Vis, I.F.A., De Koster, R., 2003. Transshipment of containers at a container terminal: An overview. European Journal of Operational Research, 147(1):1-16.
Open peer comments: Debate/Discuss/Question/Opinion
<1>