MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

DOI10.1016/j.ejor.2017.05.040zbMath1380.90105OpenAlexW2618401921WikidataQ57736442 ScholiaQ57736442MaRDI QIDQ1694325

Agostinho Agra, Maryse Oliveira

Publication date: 1 February 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10773/18404

zbMATH Keywords

branch and cutberth allocationquay crane schedulingrolling horizon heuristicmixed integer formulations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (17)

Modelling a resilient yard template under storage demand fluctuations in a container terminal ⋮ Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems ⋮ Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey ⋮ Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ The consecutive multiprocessor job scheduling problem ⋮ Berth assignment for liner carrier clusters under a cooperative environment ⋮ Pilotage planning in seaports ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ Novel formulations and modeling enhancements for the dynamic berth allocation problem ⋮ Berth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decomposition ⋮ New exact methods for the time-invariant berth allocation and quay crane assignment problem ⋮ Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels ⋮ The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm ⋮ An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times ⋮ The berth allocation problem in terminals with irregular layouts ⋮ Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays ⋮ Joint optimization of container slot planning and truck scheduling for tandem quay cranes

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Tactical berth allocation under uncertainty
• Scheduling cranes at an indented berth
• Optimal policies for the berth allocation problem under stochastic nature
• A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
• Lifting two-integer knapsack inequalities
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• The berth allocation problem: models and solution methods
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• A generalized classification scheme for crane scheduling with interference
• A scheduling method for Berth and Quay cranes
• A crane scheduling method for port container terminals
• Optimal berth allocation and time-invariant quay crane assignment in container terminals
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• The crane scheduling problem: models and solution approaches
• Reformulation by discretization: application to economic lot sizing
• Description of 2-integer continuous knapsack polyhedra
• Crane scheduling with spatial constraints
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

This page was built for publication: MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem