A tabu search heuristic for the quay crane scheduling problem
From MaRDI portal
Publication:835567
DOI10.1007/s10951-007-0029-5zbMath1168.90468OpenAlexW2071552003MaRDI QIDQ835567
Gilbert Laporte, Marcello Sammarra, Jean-François Cordeau, Maria Flavia Monaco
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0029-5
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (29)
A Benders decomposition-based framework for solving quay crane scheduling problems ⋮ The quay crane scheduling problem with time windows ⋮ The terminal-oriented ship stowage planning problem ⋮ Hybrid evolutionary computation methods for quay crane scheduling problems ⋮ On double cycling for container port productivity improvement ⋮ Tabu search and iterated local search for the cyclic bottleneck assignment problem ⋮ A heuristic for the quay crane scheduling problem based on contiguous bay crane operations ⋮ Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation ⋮ 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 ⋮ Constraint programming models for integrated container terminal operations ⋮ Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity ⋮ 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 ⋮ Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports ⋮ An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports ⋮ 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 ⋮ Simulation-based optimization for discharge/loading operations at a maritime container terminal ⋮ The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects ⋮ A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Container terminal operation and operations research -- a classification and literature review
- A crane scheduling method for port container terminals
- Crane scheduling with spatial constraints
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- Job Shop Scheduling by Simulated Annealing
- Bandwidth Packing: A Tabu Search Approach
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Fast Taboo Search Algorithm for the Job Shop Problem
This page was built for publication: A tabu search heuristic for the quay crane scheduling problem
