Interblock Crane Deployment in Container Terminals

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Bazaraa M. S., Jarvis J. J., Sherali H. D.Linear Programming and Network Flows (1990) 2nd ed.(Wiley, New York) Google Scholar
• Daganzo C. F. The crane scheduling problem. Transportation Res. B (1989) 23B(3):159–175Crossref, Google Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27:1–18Link, Google Scholar
• Fisher M. L. An applications oriented guide to Lagrangian relaxation. Interfaces (1985) 15:10–21Link, Google Scholar
• Geoffrion A. M. Lagrangian relaxation for integer programming. Math. Programming Stud. (1974) 2:82–114Crossref, Google Scholar
• Guignard M., Kim S. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math. Programming (1987) 39:215–228Crossref, Google Scholar
• Kim K. H., Bae J. W. Re-marshaling export containers in port container terminals. Comput. Indust. Engrg. (1998) 35:655–658Crossref, Google Scholar
• Kim K. H., Kim K. Y. An optimal routing algorithm for a transfer crane in port container terminals. Transportation Sci. (1999) 33:17–33Link, Google Scholar
• Kim K. Y., Kim K. H. A routing algorithm for a single transfer crane to load export containers onto a containership. Comput. Indust. Engrg. (1997) 33:673–676Crossref, Google Scholar
• Kozan E., Preston P. Genetic algorithms to schedule container transfers at multimodal terminals. Internat. Trans. Oper. Res. (1999) 6:311–329Crossref, Google Scholar
• Lai K. K., Lam K. A study ofcontainer yard equipment allocation strategy in Hong Kong. Internat. J., Model. Simulation (1994) 14:134–138Crossref, Google Scholar
• Lai K. K., Leung J. W. Analysis of yard crane deployment strategies in a container terminal. Proc. ICC & IE '96 (1996) 1187–1190Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B.The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, Chichester, UK) Google Scholar
• Li C.-L., Cai X., Lee C.-Y. Scheduling with multiple-job-onone- rocessor pattern. IIE Trans. (1998) 30:433–445Crossref, Google Scholar
• Lim A. The berth planning problem. Oper. Res. Lett. (1998) 22:105–110Crossref, Google Scholar
• Linn R., Zhang C. A heuristic for dynamic yard crane deployment in a container terminal yard. (1999) . Working paper, Department of Industrial Engineering and Engineering Management, The Hong Kong University of Science and Technology, Kowloon, Hong KongGoogle Scholar
• Linn R., Liu J., Wan Y.-W., Zhang C., Murty K. G. Rubber tired gantry crane deployment for container yard operation. (1999) . Working paper, Department ofIndustrial Engineering and Engineering Management, The Hong Kong University ofScience and Technology, Kowloon, Hong KongGoogle Scholar
• Peterkofsky R. I., Daganzo C. F. A branch and bound solution method for the crane scheduling problem. Transportation Res. B (1990) 24B(3):159–172Crossref, Google Scholar
• Shapiro J. F.Mathematical Programming: Structures and Algorithms (1979) (Wiley, New York) Google Scholar
• Zang C., Wan Y.-W., Liu J., Linn R. J. Dynamic crane deployment in container storage yards. Transportation Res. B (2000) . ForthcomingGoogle Scholar