796
Views
26
CrossRef citations to date
0
Altmetric
Articles

Integrated berth allocation and quay crane assignment with maintenance activities

, , , &
Pages 3478-3503 | Received 05 Jan 2018, Accepted 28 Sep 2018, Published online: 01 Nov 2018

References

  • Agra, A., and M. Oliveira. 2018. “MIP Approaches for the Integrated Berth Allocation and Quay Crane Assignment and Scheduling Problem.” European Journal of Operational Research 264 (1): 138–148. doi: 10.1016/j.ejor.2017.05.040
  • Ali, A. G., G. Finke, and M. L. Espinouse. 2016. “Parallel Machines Scheduling with Maintenance: Praising the Assignment Problem.” European Journal of Operational Research 252 (1): 90–97. doi: 10.1016/j.ejor.2015.12.047
  • Bierwirth, C., and F. 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
  • Bierwirth, C., and F. Meisel. 2015. “A Follow-Up Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals.” European Journal of Operational Research 244 (3): 675–689. doi: 10.1016/j.ejor.2014.12.030
  • Chan, F. T. S., S. H. Chung, L. Y. Chan, G. Finke, and M. K Tiwari. 2006. “Solving Distributed FMS Scheduling Problems Subject to Maintenance: Genetic Algorithms Approach.” Robotics and Computer Integrated Manufacturing 22 (5–6): 493–504. doi: 10.1016/j.rcim.2005.11.005
  • Chiu, Y. F., and C. J. Shih. 2012. “Rescheduling Strategies for Integrating Rush Orders with Preventive Maintenance in a Two-Machine Flow Shop.” International Journal of Production Research 50 (20): 5783–5794. doi: 10.1080/00207543.2011.627887
  • Chung, S. H., and F. T. S. Chan. 2013. “A Workload Balancing Genetic Algorithm for the Quay Crane Scheduling Problem.” International Journal of Production Research 51 (16): 4820–4834. doi: 10.1080/00207543.2013.774489
  • Correcher, F. J., and R. Alvarez-Valds. 2017. “A Biased Random-Key Genetic Algorithm for the Time-Invariant Berth Allocation and Quay Crane Assignment Problem.” Expert Systems with Applications 89: 112–128. doi: 10.1016/j.eswa.2017.07.028
  • Du, Y. Q., Q. S. Chen, J. S. L. Lam, Y. Xu, and J. X. Cao. 2015. “Modeling the Impacts of Tides and the Virtual Arrival Policy in Berth Allocation.” Transportation Science 49 (4): 939–956. doi: 10.1287/trsc.2014.0568
  • Exposito-Izquierdo, C., B. Melian-Batista, and J. M. Moreno-Vega. 2012. “An Estimation of Distribution Algorithm for Solving the Quay Crane Scheduling Problem with Availability Constraints.” International Conference on Knowledge-Based and Intelligent 243: 10–19.
  • Federgruen, A., and K. C. So. 1990. “Optimal Maintenance Policies for Single-Server Queueing Systems Subject to Breakdowns.” Operations Research 38 (2): 330–343. doi: 10.1287/opre.38.2.330
  • Giacco, G. L., A. D'Ariano, and D. Pacciarelli. 2014. “Rolling Stock Rostering Optimization Under Maintenance Constraints.” Journal of Intelligent Transportation Systems 18 (1): 95–105. doi: 10.1080/15472450.2013.801712
  • Gopalan, M. N., and H. E. Nagarwalla. 1985. “Cost-Benefit Analysis of a One-Server Two-Unit Cold Standby System with Repair and Preventive Maintenance.” Microelectronics Reliability 25 (2): 267–269. doi: 10.1016/0026-2714(85)90011-3
  • He, J.. 2016. “Berth Allocation and Quay Crane Assignment in a Container Terminal for the Trade-Off between Time-Saving and Energy-Saving.” Advanced Engineering Informatics 30 (3): 390–405. doi: 10.1016/j.aei.2016.04.006
  • Hsu, H. P.. 2016. “A HPSO for Solving Dynamic and Discrete Berth Allocation Problem and Dynamic Quay Crane Assignment Problem Simultaneously.” Swarm & Evolutionary Computation 27: 156–168. doi: 10.1016/j.swevo.2015.11.002
  • Hu, Q. M., Z. H. Hu, and Y. Du. 2014. “Berth and Quay-Crane Allocation Problem Considering Fuel Consumption and Emissions from Vessels.” Computers & Industrial Engineering 70 (4): 1–10. doi: 10.1016/j.cie.2014.01.003
  • Imai, A., H. C. Chen, E. Nishimura, and S. Papadimitriou. 2008. “The Simultaneous Berth and Quay Crane Allocation Problem.” Transportation Research Part E 44 (5): 900–920. doi: 10.1016/j.tre.2007.03.003
  • Iris, C., D. Pacino, S. Ropke, and A. Larsen. 2015. “Integrated Berth Allocation and Quay Crane Assignment Problem: Set Partitioning Models and Computational Results.” Transportation Research Part E 81: 75–97. doi: 10.1016/j.tre.2015.06.008
  • Jian, L., and F. Z. Hong. 2004. “The Predictive Models of Maintenance Costs for a Civil Airplane.” Journal of Aerospace Engineering 218 (5): 347–351.
  • Karam, A., and A. B. Eltawil. 2016. “Functional Integration Approach for the Berth Allocation, Quay Crane Assignment and Specific Quay Crane Assignment Problems.” Computers & Industrial Engineering 102: 458–466. doi: 10.1016/j.cie.2016.04.006
  • Karam, A., A. B. Eltawil, and N. A. Harraz. 2015. “An Improved Approach for the Quay Crane Assignment Problem with Limited Availability of Internal Trucks in Container Terminal.” IEEE International Conference on Industrial Engineering and Engineering Management 21: 112–116.
  • Kocuk, B., O. E. Sivrikaya, and M. Baykal-Gursoy. 2013. “Maintenance of Infinite-Server Service Systems Subjected to Random Shocks.” Computers & Industrial Engineering 66 (1): 86–94. doi: 10.1016/j.cie.2013.06.010
  • Lai, Y. C., D. C. Fan, and K. L Huang. 2015. “Optimizing Rolling Stock Assignment and Maintenance Plan for Passenger Railway Operations.” Computers & Industrial Engineering 85: 284–295. doi: 10.1016/j.cie.2015.03.016
  • Lee, D. H., and J. H. Chen. 2010. “An Improved Approach for Quay Crane Scheduling with Non-Crossing Constraints.” Engineering Optimization 42 (1): 1–15. doi: 10.1080/03052150902943020
  • Lee, C. Y., and C. S. Lin. 2001. “Single-Machine Scheduling with Maintenance and Repair Rate-Modifying Activities.” European Journal of Operational Research 135 (3): 493–513. doi: 10.1016/S0377-2217(00)00322-2
  • Lee, D. H., L. Song, and H. Wang. 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). Washington DC.
  • Lee, W. C., J. Y. Wang, and L. Y. Lee. 2015. “A Hybrid Genetic Algorithm for an Identical Parallel-Machine Problem with Maintenance Activity.” Journal of the Operational Research Society 66 (11): 1906–1918. doi: 10.1057/jors.2015.19
  • Li, M. W., W. C. Hong, J. Geng, and J. Wang. 2017. “Berth and Quay Crane Coordinated Scheduling Using Multi-Objective Chaos Cloud Particle Swarm Optimization Algorithm.” Neural Computing & Applications 28: 3163–3182. doi: 10.1007/s00521-016-2226-7
  • Li, M. Z., J. G. Jin, and C. X. Lu. 2015. “Real-Time Disruption Recovery for Integrated Berth Allocation and Crane Assignment in Container Terminals.” Transportation Research Record Journal of the Transportation Research Board 2479 (7): 49–59.
  • Li, F., J. B. Sheu, and Z. Y. Gao. 2015. “Solving the Continuous Berth Allocation and Specific Quay Crane Assignment Problems with Quay Crane Coverage Range.” Transportation Science 49 (4): 968–989. doi: 10.1287/trsc.2015.0619
  • Li, Y. H., N. Tan, and G. H. Hao. 2008. “Optimization Model and Algorithm of Aircraft Maintenance Plan.” Control Engineering of China 15 (1): 99–102.
  • Li, M. K., and T. L. Yip. 2013. “Joint Planning for Yard Storage Space and Home Berths in Container Terminals.” International Journal of Production Research 51 (10): 3143–3155. doi: 10.1080/00207543.2012.760852
  • Liang, C. J., J. Q. Guo, and Y. Yang. 2011. “Multi-Objective Hybrid Genetic Algorithm for Quay Crane Dynamic Assignment in Berth Allocation Planning.” Journal of Intelligent Manufacturing 22 (3): 471–479. doi: 10.1007/s10845-009-0304-8
  • Lim, A. 1998. “The Berth Planning Problem.” Operations Research Letters 22 (2–3): 105–110. doi: 10.1016/S0167-6377(98)00010-8
  • Liu, M., F. Chu, Z. Zhang, and C. Chu. 2015. “A Polynomial-Time Heuristic for the Quay Crane Double-Cycling Problem with Internal-Reshuffling Operations.” Transportation Research Part E 81: 52–74. doi: 10.1016/j.tre.2015.06.009
  • Liu, C., Z. Li, and C. Zhang. 2016. “Behavior Perception-Based Disruption Models for Berth Allocation and Quay Crane Assignment Problems.” Computers & Industrial Engineering 97: 258–275. doi: 10.1016/j.cie.2016.04.008
  • Luo, W. C., T. C. E. Cheng, and M. Ji. 2015. “Single-Machine Scheduling with a Variable Maintenance Activity.” Computers & Industrial Engineering 79: 168–174. doi: 10.1016/j.cie.2014.11.002
  • Ma, H. L., F. T. S. Chan, and S. H. Chung. 2014. “A Fast Approach for the Integrated Berth Allocation and Quay Crane Assignment Problem.” Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineer Manufacture 229 (11): 2076–2087. doi: 10.1177/0954405414544555
  • Maschietto, G. N., Y. Ouazene, M. G. Ravetti, M. C. D. Souza, and F. Yalaoui. 2017. “Crane Scheduling Problem with Non-Interference Constraints in a Steel Coil Distribution Centre.” International Journal of Production Research 55 (6): 1607–1622. doi: 10.1080/00207543.2016.1193249
  • Meisel, F. 2011. “The Quay Crane Scheduling Problem with Time Windows.” Naval Research Logistics 58 (7): 619–636. doi: 10.1002/nav.20471
  • Meisel, F., and C. Bierwirth. 2009. “Heuristics for the Integration of Crane Productivity in the Berth Allocation Problem.” Transportation Research Part E 45 (1): 196–209. doi: 10.1016/j.tre.2008.03.001
  • Monaco, M. F., and M. Sammarra. 2007. “The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach.” Transportation Science 41 (2): 265–280. doi: 10.1287/trsc.1060.0171
  • Park, Y. M., and K. H. Kim. 2003. “A Scheduling Method for Berth and Quay Cranes.” OR Spectrum 25 (1): 1–23. doi: 10.1007/s00291-002-0109-z
  • Pratap, S., K. B. Manoj, D. Saxena, and M. K. Tiwari. 2016. “Integrated Scheduling of Rake and Stockyard Management with Ship Berthing: A Block Based Evolutionary Algorithm.” International Journal of Production Research 54 (14): 4182–4204. doi: 10.1080/00207543.2015.1111535
  • Robenek, T., N. Umang, M. Bierlaire, and S. Ropke. 2014. “A Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports.” European Journal of Operational Research 235 (2): 399–411. doi: 10.1016/j.ejor.2013.08.015
  • Rodriguez-Molins, M., M. A. Salido, and F. Barber. 2014. “A GRASP-based Metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by Managing Vessel Cargo Holds.” Applied Intelligence 40 (2): 273–290. doi: 10.1007/s10489-013-0462-4
  • Salhi, A., G. Alsoufi, and X. Yang. 2017. “An Evolutionary Approach to a Combined Mixed Integer Programming Model of Seaside Operations as Arise in Container Ports.” Annals of Operations Research 4: 1–30.
  • Shang, X. T., J. X. Cao, and J. Ren. 2016. “A Robust Optimization Approach to the Integrated Berth Allocation and Quay Crane Assignment Problem.” Transportation Research Part E 94: 44–65. doi: 10.1016/j.tre.2016.06.011
  • Song, L., T. Cherrett, and W. Guan. 2012. “Study on Berth Planning Problem in a Container Seaport: Using an Integrated Programming Approach.” Computers & Industrial Engineering 62 (1): 119–128. doi: 10.1016/j.cie.2011.08.024
  • Turkogullari, Y. B., Z. C. Taskin, N. Aras, and I. K. Altinel. 2014. “Optimal Berth Allocation and Time-Invariant Quay Crane Assignment in Container Terminals.” European Journal of Operational Research 235 (1): 88–101. doi: 10.1016/j.ejor.2013.10.015
  • Wagenaar, J., L. Kroon, and M. Schmidt. 2017. “Maintenance Appointments in Railway Rolling Stock Rescheduling.” Transportation Science 51 (4): 1138–1160. doi: 10.1287/trsc.2016.0701
  • Xu, D., Y. Yin, and H. Li. 2010. “Scheduling Jobs under Increasing Linear Machine Maintenance Time.” Journal of Scheduling 13 (4): 443–449. doi: 10.1007/s10951-010-0182-0
  • Zhang, C., L. Zheng, Z. Zhang, L. Shi, and A. J. Armstrong. 2010. “The Allocation of Berths and Quay Cranes by using a Sub-Gradient Optimization Technique.” Computers & Industrial Engineering 58 (1): 40–50. doi: 10.1016/j.cie.2009.08.002
  • Zhen, L., E. P. Chew, and L. H. Lee. 2011. “An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs.” Transportation Science 45 (4): 483–504. doi: 10.1287/trsc.1100.0364

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.