References
- Bierwirth, Christian, and Frank Meisel. 2010. “A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals.” European Journal of Operational Research 202 (3): 615–627. doi: 10.1016/j.ejor.2009.05.031
- Bish, Ebru K. 2003. “A Multiple-Crane-Constrained Scheduling Problem in a Container Terminal.” European Journal of Operational Research 144 (1): 83–107. doi: 10.1016/S0377-2217(01)00382-4
- Daganzo, Carlos F. 1989. “The Crane Scheduling Problem.” Transportation Research Part B: Methodological 23 (3): 159–175. doi: 10.1016/0191-2615(89)90001-5
- Goodchild, Anne V., and Carlos F. Daganzo. 2006. “Double-Cycling Strategies for Container Ships and Their Effect on Ship Loading and Unloading Operations.” Transportation Science 40 (4): 473–483. doi: 10.1287/trsc.1060.0148
- Goodchild, Anne V., and C. F. Daganzo. 2007. “Crane Double Cycling in Container Ports: Planning Methods and Evaluation.” Transportation Research Part B: Methodological 41 (8): 875–891. doi: 10.1016/j.trb.2007.02.006
- Guo, Peng, Wenming Cheng, and Yi Wang. 2014. “A Modified Generalized Extremal Optimization Algorithm for the Quay Crane Scheduling Problem with Interference Constraints.” Engineering Optimization 46 (10): 1411–1429. doi: 10.1080/0305215X.2013.844803
- Imai, Akio, Kazuya Sasaki, Etsuko Nishimura, and Stratos Papadimitriou. 2006. “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. doi: 10.1016/j.ejor.2004.07.066
- Johnson, Selmer Martin. 1954. “Optimal Two- and Three-Stage Production Schedules with Setup Times Included.” Naval Research Logistics Quarterly 1 (1): 61–68. doi: 10.1002/nav.3800010110
- Kim, Kap Hwan, Jin Soo Kang, and Kwang Ryel Ryu. 2004. “A Beam Search Algorithm for the Load Sequencing of Outbound Containers in Port Container Terminals.” OR Spectrum 26 (1): 93–116. doi: 10.1007/s00291-003-0148-0
- Kim, Kap Hwan, and Young-Man Park. 2004. “A Crane Scheduling Method for Port Container Terminals.” European Journal of Operational Research 156 (3): 752–768. doi: 10.1016/S0377-2217(03)00133-4
- Lee, Der-Horng, Jiang Hang Chen, and Jin Xin Cao. 2011. “Quay Crane Scheduling for an Indented Berth.” Engineering Optimization 43 (9): 985–998. doi: 10.1080/0305215X.2010.532551
- Lee, Der-Horng, Hui Qiu Wang, and Lixin Miao. 2008. “Quay Crane Scheduling with Non-Interference Constraints in Port Container Terminals.” Transportation Research Part E: Logistics and Transportation Review 44 (1): 124–135. doi: 10.1016/j.tre.2006.08.001
- Li, Xiaoping, Qian Wang, and Cheng Wu. 2009. “Efficient Composite Heuristics for Total Flowtime Minimization in Permutation Flow Shops.” Omega 37 (1): 155–164. doi: 10.1016/j.omega.2006.11.003
- Lim, Andrew, Brian Rodrigues, Fei Xiao, and Yi Zhu. 2004. “Crane Scheduling with Spatial Constraints.” Naval Research Logistics (NRL) 51 (3): 386–406. doi: 10.1002/nav.10123
- Meisel, Frank, and Matthias Wichmann. 2010. “Container Sequencing for Quay Cranes with Internal Reshuffles.” OR Spectrum 32 (3): 569–591. doi: 10.1007/s00291-009-0191-6
- Peterkofsky, Roy I., and Carlos F. Daganzo. 1990. “A Branch and Bound Solution Method for the Crane Scheduling Problem.” Transportation Research Part B: Methodological 24 (3): 159–172. doi: 10.1016/0191-2615(90)90014-P
- Zhang, Haipeng, and Kap Hwan Kim. 2009. “Maximizing the Number of Dual-Cycle Operations of Quay Cranes in Container Terminals.” Computers & Industrial Engineering 56 (3): 979–992. doi: 10.1016/j.cie.2008.09.008
- Zhu, Yi, and Andrew Lim. 2006. “Crane Scheduling with Non-Crossing Constraint.” Journal of the Operational Research Society 57 (12): 1464–1471. doi: 10.1057/palgrave.jors.2602110