Abstract
Maximizing crane efficiency of shipping loading and unloading plays an important role in order for the modern sea transportation system to increase its port throughput with respect to pressures derived from the limited port size, high cargo transhipment volumes and limited physical facilities and equipments [9]. This can explain the concerns with the crane scheduling and management aroused from the Port of Singapore Authority (PSA) [1] and other world busiest ports (like Hong Kong [12] and Australia [6]).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bish, E.K., Leong, T.-Y., Li, C.-L., Ng, J.W.C., Simchi-Levi, D.: Analysis of a new vehicle scheduling and location problem. Naval Research Logistics 48(5), 363–385 (2001)
Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (1995)
Daganzo, C.F.: The crane scheduling problem. Transportation Research B 23(3), 159–175 (1989)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York (1983)
Ge, Y., Yih, Y.: Crane scheduling with time windows in circuit board production lines. International Journal of Production Research 33(5), 1187–1189 (1995)
Kozan, E.: Increasing the operational efficiency of container terminals in australia. Journal of the Operational Research Society 48, 151–161 (1997)
Lim, A., Xiao, F., Rodrigues, B., Zhu, Y.: Crane scheduling using tabusearch. In: 14th IEEE International Conference on Tools with Artificial Intelligence, Washington DC, USA (2002)
Matsuo, H., Shang, J.S., Sullivan, R.S.: A knowledge-based system for stacker crane control in a manufacturing environment. IEEE Transactions on Systems, Man and Cybernetics 19(5) (1989)
Peterkofsky, R.I., Daganzo, C.F.: A branch and bound solution method for the crane scheduling problem. Transportation Research 24B, 159–172 (1990)
Sahni, S.K.: Algorithms for scheduling independent tasks. Journal of the ACM 23, 116–127 (1976)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
Zhang, C., Wan, Y., Liu, J., Linn, R.J.: Dynamic crane deployment in container storage yards. Transportation Resarch Part B 36, 537–555 (2002)
Zhu, Y., Lim, A.: Crane scheduling with spatial constraints: Mathematical model and solving approaches. In: Proceedings of the 8th International Symposium on Artificial Intelligence and Mathematics (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, A., Rodrigues, B., Xu, Z. (2004). Approximation Schemes for the Crane Scheduling Problem. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive