Interblock Crane Deployment in Container Terminals
- 1 February 2002
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 36 (1), 79-93
- https://doi.org/10.1287/trsc.36.1.79.568
Abstract
We consider the problem of scheduling the movements of cranes in a container storage yard so as to minimize the total unfinished workload at the end of each time period. The problem is formulated as a mixed-integer linear program, and the computational complexity ofthe problem is analyzed. A Lagrangian decomposition solution procedure is described. A new solution approach, called the successive piecewise-linear approximation method, is also developed. Through computational experiments, we show that our proposed solution methods are both efficient and effective for large-sized problems.Keywords
This publication has 13 references indexed in Scilit:
- Genetic algorithms to schedule container transfers at multimodal terminalsInternational Transactions in Operational Research, 1999
- Re-marshaling export containers in port container terminalsComputers & Industrial Engineering, 1998
- Scheduling with multiple-job-on-one-processor patternIIE Transactions, 1998
- The berth planning problemOperations Research Letters, 1998
- A routing algorithm for a single transfer crane to load export containers onto a containershipComputers & Industrial Engineering, 1997
- A branch and bound solution method for the crane scheduling problemTransportation Research Part B: Methodological, 1990
- The crane scheduling problemTransportation Research Part B: Methodological, 1989
- Lagrangean decomposition: A model yielding stronger lagrangean boundsMathematical Programming, 1987
- An Applications Oriented Guide to Lagrangian RelaxationInforms Journal on Applied Analytics, 1985
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974