×

zbMATH — the first resource for mathematics

A survey of berth allocation and quay crane scheduling problems in container terminals. (English) Zbl 1176.90373
Summary: Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.

MSC:
90B90 Case-oriented studies in operations research
90B35 Deterministic scheduling theory in operations research
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ak, A., Erera, A.L., 2006. Simultaneous berth and quay crane scheduling for container ports, Working Paper, H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta.
[2] Bierwirth, C., Meisel, F., 2009. A fast heuristic for quay crane scheduling with interference constraints. Journal of Scheduling, doi: 10.1007/s10951-009-0105-0. · Zbl 1185.90140
[3] Bish, E.K., A multiple-crane-constrained scheduling problem in a container terminal, European journal of operational research, 144, 1, 83-107, (2003) · Zbl 1037.90023
[4] Briano, C., Briano, E., Bruzzone, A.G., 2005. Models for support maritime logistics: a case study for improving terminal planning. In: Merkuryev, Y., Zobel, R., Kerckhoffs, E. (Eds.), Proceedings of the 19th European Conference on Modelling and Simulation (ECMS). pp. 199-203.
[5] Brown, G.G.; Cormican, K.J.; Lawphongpanich, S.; Widdis, D., Optimizing submarine berthing with a persistence incentive, Naval research logistics, 44, 4, 301-318, (1997) · Zbl 0889.90106
[6] Brown, G.G.; Lawphongpanich, S.; Thurman, K.P., Optimizing ship berthing, Naval research logistics, 41, 1, 1-15, (1994) · Zbl 0800.90579
[7] Canonaco, P.; Legato, P.; Mazza, R.M.; Musmanno, R., A queuing network model for the management of berth crane operations, Computers and operations research, 35, 8, 2432-2446, (2008) · Zbl 1179.90074
[8] Chang, D.; Yan, W.; Chen, C.-H.; Jiang, Z., A berth allocation strategy using heuristics algorithm and simulation optimisation, International journal of computer applications in technology, 32, 4, 272-281, (2008)
[9] Chen, C.-Y., Hsieh, T.-W., 1999. A time-space network model for the berth allocation problem. In: 19th IFIP TC7 Conference on System Modeling and Optimization, Cambridge.
[10] Chen, L.; Bostel, N.; Dejax, P.; Cai, J.; Xi, L., A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, European journal of operational research, 181, 1, 40-58, (2007) · Zbl 1121.90054
[11] Cheong, C.Y., Lin, C.J., Tan, K.C., Liu, D.K., 2007. A multi-objective evolutionary algorithm for berth allocation in a container port. In: IEEE Congress on Evolutionary Computation 2007 (CEC 2007). IEEE Computer Society, Washington DC, pp. 927-934.
[12] Cordeau, J.-F.; Laporte, G.; Legato, P.; Moccia, L., Models and tabu search heuristics for the berth-allocation problem, Transportation science, 39, 4, 526-538, (2005)
[13] Crainic, T.G.; Kim, K.H., Intermodal transportation, Handbooks in operations research and management science, vol. 14, (2007), Elsevier Amsterdam, pp. 467-537
[14] Daganzo, C.F., The crane scheduling problem, Transportation research part B, 23, 3, 159-175, (1989)
[15] Dai, J.; Lin, W.; Moorthy, R.; Teo, C.-P., Berth allocation planning optimization in container terminals, (), 69-105 · Zbl 1213.90047
[16] Dolk, D.R.; Kottemann, J.E., Model integration and a theory of models, Decision support systems, 9, 1, 51-63, (1993)
[17] Dragovic, B.; Park, N.K.; Radmilovic, Z., Ship-berth link performance evaluation: simulation and analytical approaches, Maritime policy and management, 33, 3, 281-299, (2006)
[18] Dragovic, B.; Park, N.K.; Radmilovic, Z.; Maras, V., Simulation modelling of ship-berth link with priority service, Maritime economics and logistics, 7, 4, 316-335, (2005)
[19] Edmond, E.D.; Maggs, R.P., How useful are queue models in port investment decisions for container berths, Journal of the operational research society, 29, 8, 741-750, (1978)
[20] Gambardella, L.M.; Mastrolilli, M.; Rizzoli, A.E.; Zaffalon, M., An optimization methodology for intermodal terminal management, Journal of intelligent manufacturing, 12, 5, 521-534, (2001)
[21] Geoffrion, A., Structured modeling: survey and future research directions, Interactive transactions of ORMS, 1, 2, (1999)
[22] Giallombardo, G., Moccia, L., Salani, M., Vacca, I., 2008. The tactical berth allocation problem with quay crane assignment and transshipment-related quadratic yard costs. In: Proceedings of the European Transport Conference (ETC), pp. 1-27.
[23] Goh, K.S., Lim, A., 2000. Combining various algorithms to solve the ship berthing problem. In: Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’00). IEEE Computer Society, Los Alamitos, CA, pp. 370-373.
[24] Golias, M., Boile, M., Theofanis, S., 2006. The berth allocation problem: a formulation reflecting time window service deadlines. In: Proceedings of the 48th Transportation Research Forum Annual Meeting. Transportation Research Forum, Boston.
[25] Golias, M., Boile, M., Theofanis, S., 2007. The stochastic berth allocation problem. In: Proceedings of the International Conference on Transport Science and Technology (TRANSTEC 2007). Czech Technical University, Prague, pp. 52-66.
[26] Goodchild, A.V., 2006. Port planning for double cycling crane operations. In: Proceedings of the 85th Annual Meeting of Transportation Research Board (CD-ROM). Annual Meeting of Transportation Research Board. Washington DC.
[27] Goodchild, A.V., Daganzo, C.F., 2004. Reducing Ship Turn-Around Time Using Double-Cycling, Research Report UCB-ITS-RR-2004-4, University of California, Berkeley.
[28] Goodchild, A.V., Daganzo, C.F., 2005a. Crane double cycling in container ports: affect on ship dwell time, Research Report RR20055, University of California, Berkeley.
[29] Goodchild, A.V., Daganzo, C.F., 2005b. Performance comparison of crane double-cycling strategies, Working Paper UCB-ITS-WP-2005-2, University of California, Berkeley.
[30] Goodchild, A.V.; Daganzo, C.F., Double-cycling strategies for container ships and their effect on ship loading and unloading operations, Transportation science, 40, 4, 473-483, (2006)
[31] Goodchild, A.V.; Daganzo, C.F., Crane double cycling in container ports: planning methods and evaluation, Transportation research part B, 41, 8, 875-891, (2007)
[32] Guan, Y.; Cheung, R.K., The berth allocation problem: models and solution methods, OR spectrum, 26, 1, 75-92, (2004) · Zbl 1161.90430
[33] Guan, Y.; Xiao, W.-Q.; Cheung, R.K.; Li, C.-L., A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis, Operations research letters, 30, 5, 343-350, (2002) · Zbl 1010.90026
[34] Han, M., Li, P., Sun, J., 2006. The algorithm for berth scheduling problem by the hybrid optimization strategy GASA. In: Proceedings of the Ninth International Conference on Control, Automation, Robotics and Vision (ICARCV’06). IEEE Computer Society, Washington DC, pp. 1-4.
[35] Hansen, P.; Ogˇuz, C., A note on formulations of static and dynamic berth allocation problems, LES cahiers du GERAD, 30, 1-17, (2003)
[36] Hansen, P.; Ogˇuz, C.; Mladenovic, N., Variable neighborhood search for minimum cost berth allocation, European journal of operational research, 191, 3, 636-649, (2008) · Zbl 1160.90497
[37] Hendriks, M.P.M., Laumanns, M., Lefeber, E., Udding, J.T., 2008. Robust periodic berth planning of container vessels. In: Kopfer, H., Gnnther, H.-O., Kim, K.H. (Eds.), Proceedings of the Third German-Korean Workshop on Container Terminal Management: IT-based Planning and Control of Seaport Container Terminals and Transportation Systems, pp. 1-13. · Zbl 1201.90027
[38] Henesey, L., Davidsson, P., Persson, J.A., 2004. Using simulation in evaluating berth allocation at a container terminal. In: Presented at Third International Conference on Computer Applications and Information Technology in the Maritime Industries (COMPIT’04), Siguënza, May 9-12.
[39] Hoffarth, L., Voß, S., 1994. Berth allocation in a container terminal – development of a decision support system (in German). In: Dyckhoff, H., Derigs, U., Salomon, M., Tijms, H.C. (Eds.), Operations Research Proceedings 1993. Springer, Berlin et al., pp. 89-95.
[40] Imai, A.; Chen, H.C.; Nishimura, E.; Papadimitriou, S., The simultaneous berth and quay crane allocation problem, Transportation research part E, 44, 5, 900-920, (2008)
[41] Imai, A.; Nagaiwa, K.; Tat, C.W., Efficient planning of berth allocation for container terminals in Asia, Journal of advanced transportation, 31, 1, 75-94, (1997)
[42] Imai, A.; Nishimura, E.; Hattori, M.; Papadimitriou, S., Berth allocation at indented berths for mega-containerships, European journal of operational research, 179, 2, 579-593, (2007) · Zbl 1114.90004
[43] Imai, A.; Nishimura, E.; Papadimitriou, S., The dynamic berth allocation problem for a container port, Transportation research part B, 35, 4, 401-417, (2001)
[44] Imai, A.; Nishimura, E.; Papadimitriou, S., Berth allocation with service priority, Transportation research part B, 37, 5, 437-457, (2003)
[45] Imai, A.; Nishimura, E.; Papadimitriou, S., Berthing ships at a multi-user container terminal with a limited quay capacity, Transportation research part E, 44, 1, 136-151, (2008)
[46] Imai, A.; Sasaki, K.; Nishimura, E.; Papadimitriou, S., Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks, European journal of operational research, 171, 2, 373-389, (2006) · Zbl 1090.90009
[47] Imai, A.; Sun, X.; Nishimura, E.; Papadimitriou, S., Berth allocation in a container port: using a continuous location space approach, Transportation research part B, 39, 3, 199-221, (2005)
[48] Imai, A.; Zhang, J.-T.; Nishimura, E.; Papadimitriou, S., The berth allocation problem with service time and delay time objectives, Maritime economics and logistics, 9, 4, 269-290, (2007)
[49] Johnson, S., Optimal two- and three-stage production schedules with setup times, Naval research logistics quarterly, 1, 1, 61-68, (1954) · Zbl 1349.90359
[50] Jung, D.H., Park, Y.-M., Lee, B.K., Kim, K.H., Ryu, K.R., 2006. A quay crane scheduling method considering interference of yard cranes in container terminals. In: Gelbukh, A.F., García, C.A.R. (Eds.), Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (MICAI 2006), vol. 4293 of LNCS. Springer, Berlin et al., pp. 461-471.
[51] Kim, K.H., 2005. Models and methods for operations in port container terminals. In: Langevin, A., Riopel, D. (Eds.), Logistics systems: design and optimization. Gerad 25th Anniversary Series. Springer, Berlin et al., pp. 213-243.
[52] Kim, K.H.; Kang, J.S.; Ryu, K.R., A beam search algorithm for the load sequencing of outbound containers in port container terminals, OR spectrum, 26, 1, 93-116, (2004) · Zbl 1161.90410
[53] Kim, K.H.; Moon, K.C., Berth scheduling by simulated annealing, Transportation research part B, 37, 6, 541-560, (2003)
[54] Kim, K.H.; Park, Y.M., A crane scheduling method for port container terminals, European journal of operational research, 156, 3, 752-768, (2004) · Zbl 1062.90027
[55] Lai, K.K.; Shih, K., A study of container berth allocation, Journal of advanced transportation, 26, 1, 45-60, (1992)
[56] Lee, D.-H., Song, L., Wang, H., 2006. Bilevel programming model and solutions of berth allocation and quay crane scheduling. In: Proceedings of 85th Annual Meeting of Transportation Research Board (CD-ROM). Annual Meeting of Transportation Research Board. Washington DC.
[57] Lee, D.-H., Wang, H.Q., Miao, L., 2007. An approximation algorithm for quay crane scheduling with non-interference constraints in port container terminals. Presented at Tristan VI, Phuket, June 10-15.
[58] Lee, D.-H.; Wang, H.Q.; Miao, L., Quay crane scheduling with non-interference constraints in port container terminals, Transportation research part E, 44, 1, 124-135, (2008)
[59] Lee, D.-H.; Wang, H.Q.; Miao, L., Quay crane scheduling with handling priority in port container terminals, Engineering optimization, 40, 2, 179-189, (2008)
[60] Lee, Y.; Chen, C.-Y., An optimization heuristic for the berth scheduling problem, European journal of operational research, 196, 2, 500-508, (2008)
[61] Lee, Y.H.; Kang, J.; Ryu, K.R.; Kim, K.H., Optimization of container load sequencing by a hybrid of ant colony optimization and tabu search, Lecture notes in computer science, 3611, 1259-1268, (2005)
[62] Legato, P., Gulli, D., Trunfio, R., 2008. The quay crane deployment problem at a maritime container terminal. In: Proceedings of the 22th European Conference on Modelling and Simulation (ECMS 2008), pp. 53-59.
[63] Legato, P.; Mazza, R.M., Berth planning and resources optimisation at a container terminal via discrete event simulation, European journal of operational research, 133, 3, 537-547, (2001) · Zbl 1002.90504
[64] Li, C.-L.; Cai, X.; Lee, C.-Y., Scheduling with multiple-job-on-one-processor pattern, IIE transactions, 30, 5, 433-445, (1998)
[65] Liang, C.; Huang, Y.; Yang, Y., A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning, Computers and industrial engineering, 56, 3, 1021-1028, (2008)
[66] Lim, A., The berth planning problem, Operations research letters, 22, 2, 105-110, (1998) · Zbl 0911.90283
[67] Lim, A., 1999. An effective ship berthing algorithm. In: Thomas, D. (Ed.), Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-vol-1). Morgan Kaufmann Publishers, San Francisco, pp. 594-599.
[68] Lim, A., Rodrigues, B., Xiao, F., Zhu, Y., 2002. Crane scheduling using tabu search. In: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’02). IEEE Computer Society, Washington DC, pp. 146-153.
[69] Lim, A.; Rodrigues, B.; Xiao, F.; Zhu, Y., Crane scheduling with spatial constraints, Naval research logistics, 51, 3, 386-406, (2004) · Zbl 1054.90036
[70] Lim, A., Rodrigues, B., Xu, Z., 2004b. Approximation schemes for the crane scheduling problem. In: Hagerup, T., Katajainen, J. (Eds.), Ninth Scandinavian Workshop on Algorithm Theory (SWAT 2004), vol. 3111 of LNCS. Springer, Berlin et al., pp. 323-335. · Zbl 1095.90551
[71] Lim, A., Rodrigues, B., Xu, Z., 2004c. Solving the crane scheduling problem using intelligent search schemes (extended abstract). In: Wallace, M. (Ed.), 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), vol. 3258 of LNCS. Springer, Berlin et al., pp. 747-751. · Zbl 1152.90454
[72] Lim, A.; Rodrigues, B.; Xu, Z., A m-parallel crane scheduling problem with a non-crossing constraint, Naval research logistics, 54, 2, 115-127, (2007) · Zbl 1126.90025
[73] Liu, J.; Wan, Y.-W.; Wang, L., Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures, Naval research logistics, 53, 1, 60-74, (2006) · Zbl 1112.90031
[74] Lokuge, P., Alahakoon, D., 2004. Hybrid BDI agents with improved learning capabilities for adaptive planning in a container terminal application. In: Proceedings of the International Conference on Intelligent Agent Technology (IAT’04). IEEE Computer Society, Los Alamitos, pp. 120-126.
[75] Lokuge, P., Alahakoon, D., 2005. Reinforcement learning in neuro BDI agents for achieving agent’s intentions in vessel berthing applications. In: Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA’05). IEEE Computer Society, Los Alamitos, pp. 681-686.
[76] Lokuge, P.; Alahakoon, D., Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents, European journal of operational research, 177, 3, 1985-2015, (2007) · Zbl 1110.90038
[77] Lokuge, P., Alahakoon, D., Dissanayake, P., 2004. Collaborative neuro-BDI agents in container terminals. In: Proceedings of the 18th International Conference on Advanced Information Networking and Applications (AINA’04). IEEE Computer Society, Los Alamitos, pp. 155-158.
[78] Mauri, G.R., Oliveira, A.C.M., Lorena, L.A.N., 2008. A hybrid column generation approach for the berth allocation problem. In: van Hemert, J., Cotta, C. (Eds.), Eighth European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2008), vol. 4972 of LNCS. Springer, Berlin et al., pp. 110-122.
[79] Meersmans, P.J.M., Dekker, R., 2001. Operations research supports container handling. Econometric Institute Report 234, Erasmus University Rotterdam.
[80] Meier, L.; Schumann, R., Coordination of interdependent planning systems, a case study, (), 389-396
[81] Meisel, F., 2009. Seaside Operations Planning in Container Terminals. Physica, Berlin et al.
[82] Meisel, F., Bierwirth, C., 2006. Integration of berth allocation and crane assignment to improve the resource utilization at a seaport container terminal. In: Haasis, H.-D., Kopfer, H., Schönberger, J. (Eds.), Operations Research Proceedings 2005. Springer, Berlin et al., pp. 105-110.
[83] Meisel, F.; Bierwirth, C., Heuristics for the integration of crane productivity in the berth allocation problem, Transportation research part E, 45, 1, 196-209, (2009)
[84] Meisel, F.; Bierwirth, C., The berth allocation problem with a cut-and-run option, (), 283-288 · Zbl 1209.90024
[85] Meisel, F., Wichmann, M., 2008. Container sequencing for quay cranes with internal reshuffles, Working Paper, Martin-Luther-University, Halle-Wittenberg. · Zbl 1201.90031
[86] Moccia, L.; Cordeau, J.-F.; Gaudioso, M.; Laporte, G., A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal, Naval research logistics, 53, 1, 45-59, (2006) · Zbl 1112.90033
[87] Monaco, M.F.; Sammarra, M., The berth allocation problem: a strong formulation solved by a Lagrangean approach, Transportation science, 41, 2, 265-280, (2007)
[88] Moon, K., 2000. A mathematical model and a heuristic algorithm for berth planning. Ph.D. Thesis, Pusan National University, Pusan.
[89] Moorthy, R.; Teo, C.-P., Berth management in container terminal: the template design problem, OR spectrum, 28, 4, 495-518, (2006) · Zbl 1098.90510
[90] Muhanna, W., Pick, R., 1988. Composite models in SYMMS. In: Proceedings 21st Annual Hawaii International Conference on System Sciences (HICSS 21), vol. 3. IEEE Computer Society, Washington DC, pp. 418-427.
[91] Ng, W.C.; Mak, K.L., Quay crane scheduling in container terminals, Engineering optimization, 38, 6, 723-737, (2006)
[92] Nishimura, E.; Imai, A.; Papadimitriou, S., Berth allocation planning in the public berth system by genetic algorithms, European journal of operational research, 131, 2, 282-292, (2001) · Zbl 0991.90074
[93] Ogˇuz, C., Błażewicz, J., Cheng, T.C.E., Machowiak, M., 2004. Berth allocation as a moldable task scheduling problem. In: Proceedings of the Ninth International Workshop on Project Management and Scheduling (PMS 2004). Nancy, pp. 201-205.
[94] Park, K.T.; Kim, K.H., Berth scheduling for container terminals by using a sub-gradient optimization technique, Journal of the operational research society, 53, 9, 1054-1062, (2002) · Zbl 1139.90330
[95] Park, Y.M.; Kim, K.H., A scheduling method for berth and quay cranes, OR spectrum, 25, 1, 1-23, (2003) · Zbl 1012.90011
[96] Peterkofsky, R.I.; Daganzo, C.F., A branch and bound solution method for the crane scheduling problem, Transportation research part B, 24, 3, 159-172, (1990)
[97] Pinedo, M., Scheduling – theory algorithms and systems, (2002), Prentice-Hall Englewood Cliffs, NJ · Zbl 1145.90394
[98] Rashidi, H., 2006. Dynamic scheduling of automated guided vehicles. Ph.D. Thesis, University of Essex, Colchester.
[99] Sammarra, M.; Cordeau, J.-F.; Laporte, G.; Monaco, M.F., A tabu search heuristic for the quay crane scheduling problem, Journal of scheduling, 10, 4-5, 327-336, (2007) · Zbl 1168.90468
[100] Schonfeld, P.; Frank, S., Optimizing the use of a containership berth, Transportation research record, 984, 56-62, (1984)
[101] Stahlbock, R.; Voß, S., Operations research at container terminals: a literature update, OR spectrum, 30, 1, 1-52, (2008) · Zbl 1133.90313
[102] Steenken, D.; Voß, S.; Stahlbock, R., Container terminal operation and operations research – a classification and literature review, OR spectrum, 26, 1, 3-49, (2004) · Zbl 1160.90322
[103] Steenken, D.; Winter, T.; Zimmermann, U.T., Stowage and transport optimization in ship planning, (), 731-745 · Zbl 1004.90008
[104] Tavakkoli-Moghaddam, R.; Makui, A.; Salahi, S.; Bazzazi, M.; Taheri, F., An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports, Computers and industrial engineering, 56, 1, 241-248, (2009)
[105] Theofanis, S., Boile, M., Golias, M., 2007a. An optimization based genetic algorithm heuristic for the berth allocation problem. IEEE Congress on Evolutionary Computation 2007 (CEC 2007). IEEE Computer Society, Washington DC, pp. 4439-4445.
[106] Theofanis, S., Golias, M., Boile, M., 2007b. Berth and quay crane scheduling: a formulation reflecting service deadlines and productivity agreements. In: Proceedings of the International Conference on Transport Science and Technology (TRANSTEC 2007). Czech Technical University, Prague, pp. 124-140.
[107] Tong, C.J., Lau, H.C., Lim, A., 1999. Ant colony optimization for the ship berthing problems. In: Thiagarajan, P.S., Yap, R. (Eds.), Fifth Asian Computing Science Conference (ASIAN’99), vol. 1742 of LNCS. Springer, Berlin et al., pp. 359-370.
[108] Vacca, I., Bierlaire, M., Salani, M., 2007. Optimization at container terminals: Status, trends and perspectives. In: Proceedings of the Swiss Transport Research Conference (STRC). Monte Veritá/Ascona, pp. 1-21.
[109] Vis, I.F.A.; de Koster, R., Transshipment of containers at a container terminal: an overview, European journal of operational research, 147, 1, 1-16, (2003) · Zbl 1011.90005
[110] Wang, F.; Lim, A., A stochastic beam search for the berth allocation problem, Decision support systems, 42, 4, 2186-2196, (2007)
[111] Winter, T., 1999. Online and real-time dispatching problems. Ph.D. Thesis, Technical University Braunschweig.
[112] Zhang, H.; Kim, K.H., Maximizing the number of dual-cycle operations of quay cranes in container terminals, Computers and industrial engineering, 56, 3, 979-992, (2009)
[113] Zhou, P., Kang, H., Lin, L., 2006. A dynamic berth allocation model based on stochastic consideration. In: Proceedings of the Sixth World Congress on Intelligent Control and Automation (WCICA 2006), vol. 2. IEEE Computer Society, Washington DC, pp. 7297-7301.
[114] Zhu, Y.; Lim, A., Crane scheduling with non-crossing constraint, Journal of the operational research society, 57, 12, 1464-1471, (2006) · Zbl 1123.90042
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.