Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level

DOI10.1016/j.cor.2018.07.005zbMath1458.90334OpenAlexW2813258979WikidataQ58839244 ScholiaQ58839244MaRDI QIDQ1654372

Ghaith Rabadi, Mohamed Al-Salem, Mohamed Kais Msakni, Mariam Kotachi, Ali H. Diabat

Publication date: 8 August 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.005

zbMATH Keywords

schedulingmixed-integer programmingcontainer terminalsquay crane scheduling problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals ⋮ 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 ⋮ Berth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decomposition

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Hybrid evolutionary computation methods for quay crane scheduling problems
• A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
• A tabu search heuristic for the quay crane scheduling problem
• On-line scheduling with non-crossing constraints
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A stochastic model for the throughput analysis of passing dual yard cranes
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• Approximate the scheduling of quay cranes with non-crossing constraints
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
• Modeling and solving rich quay crane scheduling problems
• A crane scheduling method for port container terminals
• Scheduling small number of quay cranes with non-interference constraint
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
• A fast heuristic for quay crane scheduling with interference constraints
• The crane scheduling problem: models and solution approaches
• The quay crane scheduling problem with time windows
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal

This page was built for publication: Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level