A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
From MaRDI portal
Publication:3423263
DOI10.1002/nav.20121zbMath1112.90033OpenAlexW2047449665MaRDI QIDQ3423263
Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Manlio Gaudioso
Publication date: 20 February 2007
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20121
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (37)
A Benders decomposition-based framework for solving quay crane scheduling problems ⋮ The quay crane scheduling problem with time windows ⋮ A tabu search heuristic for the quay crane scheduling problem ⋮ Some complexity results and an efficient algorithm for quay crane scheduling problem ⋮ Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems ⋮ Hybrid evolutionary computation methods for quay crane scheduling problems ⋮ Scheduling multiple factory cranes on a common track ⋮ On double cycling for container port productivity improvement ⋮ A heuristic for the quay crane scheduling problem based on contiguous bay crane operations ⋮ A reclaimer scheduling problem arising in coal stockyard management ⋮ Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ The crane scheduling problem: models and solution approaches ⋮ Determining crane areas in intermodal transshipment yards: the yard partition problem ⋮ Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel ⋮ Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm ⋮ Constraint programming models for integrated container terminal operations ⋮ Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity ⋮ A branch-and-cut algorithm for factory crane scheduling problem ⋮ Robust optimization for the integrated berth allocation and quay crane assignment problem ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem ⋮ A generalized classification scheme for crane scheduling with interference ⋮ New bounds and algorithms for the transshipment yard scheduling problem ⋮ An integrated model for the transshipment yard scheduling problem ⋮ How to park freight trains on rail-rail transshipment yards: the train location problem ⋮ An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports ⋮ Vehicle Routing Problems and Container Terminal Operations – An Update of Research ⋮ Approximate the scheduling of quay cranes with non-crossing constraints ⋮ The role of operational research in green freight transportation ⋮ Operations research at container terminals: a literature update ⋮ An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem ⋮ Modeling and solving rich quay crane scheduling problems ⋮ A fast heuristic for quay crane scheduling with interference constraints ⋮ Container sequencing for quay cranes with internal reshuffles ⋮ An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability ⋮ A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules ⋮ Scheduling for multi-robot routing with blocking and enabling constraints ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals
Uses Software
Cites Work
This page was built for publication: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
