Mathematical models for the berth allocation problem in dry bulk terminals

DOI10.1007/S10951-017-0510-8MaRDI QIDQ1707825zbMATH OpenOpenAlexFDO

Authors Andreas T. Ernst, Gaurav Singh, Gita Taherkhani, Ceyda Oğuz

Publication date 4 April 2018

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-017-0510-8

zbMATH Keywords

mixed integer linear programmingvalid inequalitiesberth allocationbulk material

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• The berth allocation problem: models and solution methods
• Mathematical modelling of container transfers and storage locations at seaport terminals
• Berth allocation planning optimization in container terminals
• Mathematical models and solution methods for optimal container terminal yard layouts
• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• The berth allocation problem in terminals with irregular layouts
• A dynamic and flexible berth allocation model with stochastic vessel arrival times
• Constraint and mathematical programming models for integrated port container terminal operations
• The dynamic berth allocation problem: A linearized formulation

Cites work

• A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
• An exact strip packing algorithm based on canonical forms
• Berth allocation planning in the public berth system by genetic algorithms
• Berth allocation with time-dependent physical limitations on vessels
• Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
• Off-line scheduling with forbidden zones
• Rail schedule optimisation in the hunter valley coal chain
• Scheduling inspired models for two-dimensional packing problems
• The berth allocation problem: models and solution methods
• The berth planning problem

Cited in

(12)

• The berth allocation problem: models and solution methods
• The consecutive multiprocessor job scheduling problem
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
• Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports
• Berth allocation with time-dependent physical limitations on vessels
• Terminal allocation problem in a transshipment hub considering bunker consumption
• The berth allocation problem in terminals with irregular layouts
• A set-partitioning-based model for the berth allocation problem under time-dependent limitations
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
• The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
• Scheduling of waterways with tide and passing box

This page was built for publication: Mathematical models for the berth allocation problem in dry bulk terminals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707825)