The berth planning problem
From MaRDI portal
Publication:1271388
DOI10.1016/S0167-6377(98)00010-8zbMath0911.90283WikidataQ59445243 ScholiaQ59445243MaRDI QIDQ1271388
Publication date: 5 May 1999
Published in: Operations Research Letters (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (44)
A crane scheduling method for port container terminals ⋮ A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Tactical berth allocation under uncertainty ⋮ Managing the ship movements in the Port of Venice ⋮ A set-partitioning-based model for the berth allocation problem under time-dependent limitations ⋮ Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems ⋮ Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents ⋮ Berth allocation at indented berths for mega-containerships ⋮ Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems ⋮ Multi-objective and prioritized berth allocation in container ports ⋮ The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions ⋮ A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics ⋮ Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs ⋮ On contiguous and non-contiguous parallel task scheduling ⋮ A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics ⋮ On minimizing dataset transfer time in an acyclic network with four servers ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem ⋮ Quay partitioning problem ⋮ Improved sequential insertion heuristics for berth allocation problems ⋮ Berth allocation with time-dependent physical limitations on vessels ⋮ Inventory-based dispatching of automated guided vehicles on container terminals ⋮ Berth management in container terminal: the template design problem ⋮ Mathematical models for the berth allocation problem in dry bulk terminals ⋮ Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels ⋮ Robust scheduling for berth allocation and quay crane assignment problem ⋮ Integrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channel ⋮ Variable neighborhood search for minimum cost berth allocation ⋮ An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports ⋮ The berth allocation problem in terminals with irregular layouts ⋮ Operations research at container terminals: a literature update ⋮ A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports ⋮ Time-constrained project scheduling with adjacent resources ⋮ Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex ⋮ A critical-shaking neighborhood search for the yard allocation problem ⋮ Robust cyclic berth planning of container vessels ⋮ Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem ⋮ Combinatorial approach to exactly solving discrete and hybrid berth allocation problem ⋮ Robust berth scheduling with uncertain vessel delay and handling time ⋮ Fuzziness in the Berth Allocation Problem ⋮ Metaheuristic approaches for the Berth Allocation Problem ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals ⋮ NONLINEAR MATHEMATICAL PROGRAMMING FOR OPTIMAL MANAGEMENT OF CONTAINER TERMINALS ⋮ Unnamed Item ⋮ A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
Cites Work
This page was built for publication: The berth planning problem
