A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
From MaRDI portal
Publication:3423263
DOI10.1002/NAV.20121zbMATH Open1112.90033OpenAlexW2047449665MaRDI QIDQ3423263FDOQ3423263
Authors: Luigi Moccia, Jean-François Cordeau, G. Laporte, 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
Recommendations
- An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
- The Joint quay crane scheduling and block allocation problem in container terminals
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
- Approximation algorithm for uniform quay crane scheduling at container ports
- A multiple-crane-constrained scheduling problem in a container terminal
- Some complexity results and an efficient algorithm for quay crane scheduling problem
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (42)
- A fast heuristic for quay crane scheduling with interference constraints
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research
- The quay crane scheduling problem with time windows
- An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports
- The role of operational research in green freight transportation
- Approximate the scheduling of quay cranes with non-crossing constraints
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- A survey of berth allocation and quay crane scheduling problems in container terminals
- How to park freight trains on rail-rail transshipment yards: the train location problem
- Some complexity results and an efficient algorithm for quay crane scheduling problem
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A tabu search heuristic for the quay crane scheduling problem
- Hybrid evolutionary computation methods for quay crane scheduling problems
- A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
- On double cycling for container port productivity improvement
- 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
- Container sequencing for quay cranes with internal reshuffles
- Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
- Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel
- Scheduling cranes at an indented berth
- A branch-and-cut algorithm for factory crane scheduling problem
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- Scheduling multiple factory cranes on a common track
- An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
- A reclaimer scheduling problem arising in coal stockyard management
- A Benders decomposition-based framework for solving quay crane scheduling problems
- Scheduling for multi-robot routing with blocking and enabling constraints
- Carbon-efficient scheduling problem of electric rubber-tyred gantry cranes in a container terminal
- Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm
- Operations research at container terminals: a literature update
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
- Modeling and solving rich quay crane scheduling problems
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
- New bounds and algorithms for the transshipment yard scheduling problem
- Constraint programming models for integrated container terminal operations
- A generalized classification scheme for crane scheduling with interference
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
- The crane scheduling problem: models and solution approaches
- An integrated model for the transshipment yard scheduling problem
- Determining crane areas in intermodal transshipment yards: the yard partition problem
- Robust optimization for the integrated berth allocation and quay crane assignment problem
Uses Software
This page was built for publication: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423263)
