A follow-up survey of berth allocation and quay crane scheduling problems in container terminals

From MaRDI portal
Publication:319438


DOI10.1016/j.ejor.2014.12.030zbMath1346.90326MaRDI QIDQ319438

Christian Bierwirth, Frank Meisel

Publication date: 6 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.030


90B35: Deterministic scheduling theory in operations research

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming


Related Items

New Lower Bound and Exact Method for the Continuous Berth Allocation Problem, Metaheuristic approaches for the Berth Allocation Problem, Vehicle Sequencing at Transshipment Terminals with Handover Relations, Vessel Service Planning in Seaports, An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model, Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA‐II, Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity, Simultaneous operation of next-generation and traditional quay cranes at container terminals, The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions, Robust optimization for the integrated berth allocation and quay crane assignment problem, Quay partitioning problem, Improved sequential insertion heuristics for berth allocation problems, Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem, Berth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decomposition, Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model, Scheduling cranes at an indented berth, Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals, A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints, A Benders decomposition-based framework for solving quay crane scheduling problems, The matching relaxation for a class of generalized set partitioning problems, Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level, Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm, MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem, A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations, A generalized classification scheme for crane scheduling with interference, 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, Integrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channel, An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports, Exact and heuristic methods for optimizing lock-quay system in inland waterway, The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm, The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach, Scheduling cooperative gantry cranes with seaside and landside jobs, Approximate the scheduling of quay cranes with non-crossing constraints, A feasibility-based heuristic for the container pre-marshalling problem, The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion, The berth allocation problem in terminals with irregular layouts, An exact solution approach for scheduling cooperative gantry cranes, Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective, An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability, Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays, The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects, Routing two stacking cranes with predetermined container sequences, Optimizing consolidation processes in hubs: the hub-arrival-departure problem, New formulations and solutions for the strategic berth template problem, Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems, Twin-crane scheduling during seaside workload peaks with a dedicated handshake area, 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, Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel, Constraint programming models for integrated container terminal operations, Pilotage planning in seaports, Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space, Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports, An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times, Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions, Assignment problem with conflicts, Machine scheduling with soft precedence constraints, A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals, A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control, Combinatorial approach to exactly solving discrete and hybrid berth allocation problem, Selecting algorithms for large berth allocation problems, Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles, Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas, Scheduling ships movements within a canal harbor, Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards, Minimum cost noncrossing flow problem on layered networks, Solving the single crane scheduling problem at rail transshipment yards, Novel formulations and modeling enhancements for the dynamic berth allocation problem, Integrated truck and workforce scheduling to accelerate the unloading of trucks, Berth assignment for liner carrier clusters under a cooperative environment, Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems, Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination, On the Berth Allocation Problem, A Decision Model for Berth Allocation Under Uncertainty Considering Service Level Using an Adaptive Differential Evolution Algorithm, On minimizing dataset transfer time in an acyclic network with four servers



Cites Work