An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability

DOI10.1016/J.EJOR.2020.09.033zbMATH Open1487.90328OpenAlexW3095465449MaRDI QIDQ2029972FDOQ2029972

Authors: Lixin Tang, Roberto Baldacci, Andrew Lim, Defeng Sun 

Publication date: 4 June 2021

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

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

Recommendations

• Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
• A crane scheduling method for port container terminals
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem

zbMATH Keywords

logic-based Benders decompositionquay crane schedulingOR in maritime industryvessel stability constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• A crane scheduling method for port container terminals
• Logic-based Benders decomposition
• Planning and Scheduling by Logic-Based Benders Decomposition
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Operations research at container terminals: a literature update
• Transshipment of containers at a container terminal: An overview
• Title not available (Why is that?)
• Modeling and solving rich quay crane scheduling problems
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
• The crane scheduling problem: models and solution approaches
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• 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
• A fast heuristic for quay crane scheduling with interference constraints
• 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 study of the unidirectional quay crane scheduling problem: complexity and risk-aversion

Cited In (16)

• Decomposition algorithms for the robust unidirectional quay crane scheduling problems
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• A decomposition method for the group-based quay crane scheduling problem
• Scheduling in manufacturing with transportation: classification and solution techniques
• Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
• Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity
• Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
• A collaborative decision support framework for sustainable cargo composition in container shipping services
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
• 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

This page was built for publication: An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability

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