345
Views
18
CrossRef citations to date
0
Altmetric
Original Articles

Loading and unloading operations in container terminals

&
Pages 287-297 | Received 01 Jul 2001, Accepted 01 Jul 2003, Published online: 17 Aug 2010

References

  • Ahuja , R. K. , Magnanti , T. L. and Orlin , J. B. 1993 . Network Flows: Theory, Algorithms, and Applications , Englewood Cliffs, NJ : Prentice Hall .
  • Bish , E. K. 2003 . A multiple-crane-constrained scheduling problem in a container terminal . European Journal of Operational Research , 144 : 83 – 107 .
  • Bish , E. K. , Chen , F. Y. , Leong , Y. T. , Liu , Q. , Nelson , B. L. , Ng , J. W. C. and Simchi-Levi , D. 2001 . Dispatching vehicles in a mega container terminal , Blacksburg, VA : Working paper, Department of Industrial and Systems Engineering, Virginia, Tech .
  • Bish , E. K. , Leong , Y. T. , Li , C.-L. , Ng , J. W. C. and Simchi-Levi , D. 2001 . Analysis of a new scheduling and location problem. . Naval Research Logistics , 48 : 363 – 385 .
  • Bostel , N. and Dejax , P. 1998 . Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard . Transportation Science , 32 : 370 – 379 .
  • Brown , G. G. , Cormican , K. J. , Lawphongpanich , S. and Widdis , D. B. 1997 . Optimizing submarine berthing with a persistence incentive . Naval Research Logistics , 44 : 301 – 318 .
  • Coffman , E. G. Jr. and Gilbert , E. N. 1985 . On the expected relative performance of list scheduling . Operations Research , 33 : 548 – 561 .
  • Daganzo , C. F. 1989 . The crane scheduling problem . Transportation Research B , 23 : 159 – 175 .
  • Daganzo , C. F. 1990 . The productivity of multipurpose seaport terminals . Transportation Science , 24 : 205 – 216 .
  • De Castilho , B. and Daganzo , C. F. 1993 . Handling strategies for import containers at marine terminals . Transportation Research B , 27 : 151 – 166 .
  • Easa , S. M. 1987 . Approximate queueing models for analyzing harbor terminal operations . Transportation Research B , 21 : 269 – 286 .
  • Gransberg , D. D. and Basilotto , J. P. 1998 . Cost engineering optimum seaport capacity . Cost Engineering , 40 ( 9 ) : 28 – 32 .
  • Kim , K. H. and Kim , K. Y. 1999 . An optimal routing algorithm for a transfer crane in port container terminals . Transportation Science , 33 : 17 – 33 .
  • Kim , K. H. , Park , Y. M. and Ryu , K. R. 2000 . Deriving decision rules to locate export containers in container yards . European Journal of Operational Research , 124 : 89 – 101 .
  • Lawler , E. L. , Lenstra , J. K. , Kan , A. H. G. and Shmoys , D. B. 1993 . “ Sequencing and scheduling: algorithms and complexity ” . In andbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory , Edited by: Graves , S. C. , Rinnooy Kan , A. H. G. and Zipkin , P. H. Amsterdam : North-Holland .
  • Li , C.-L. , Cai , X. and Lee , C.-Y. 1998 . Scheduling with multiple-job-on-one-processor pattern . IIE Transactions , 30 : 433 – 445 .
  • Lim , A. 1998 . The berth planning problem . Operations Research Letters , 22 : 105 – 110 .
  • Peterkofsky , R. I. and Daganzo , C. F. 1990 . A branch and bound solution method for the crane scheduling problem . Transportation Research B , 24 : 159 – 172 .
  • Powell , W. B. and Carvalho , T. A. 1998 . Real-time optimization of containers and flatcars for intermodal operations . Transportation Science , 32 : 110 – 126 .
  • Shabayek , A. A. and Yeung , W. W. 2002 . A simulation model for the Kwai Chung container terminals in Hong Kong . European Journal of Operational Research , 140 : 1 – 11 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.