A tabu search heuristic for the quay crane scheduling problem

DOI10.1007/S10951-007-0029-5zbMATH Open1168.90468OpenAlexW2071552003MaRDI QIDQ835567FDOQ835567

G. Laporte, Maria Flavia Monaco, Marcello Sammarra, Jean-François Cordeau

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

Recommendations

• A fast heuristic for quay crane scheduling with interference constraints
• A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
• The quay crane scheduling problem with time windows
• Some complexity results and an efficient algorithm for quay crane scheduling problem

zbMATH Keywords

tabu searchcontainer terminalcrane schedulingdisjunctive graph

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Search theory (90B40)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• A crane scheduling method for port container terminals
• Title not available (Why is that?)
• Container terminal operation and operations research -- a classification and literature review
• Job Shop Scheduling by Simulated Annealing
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Title not available (Why is that?)
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• Bandwidth Packing: A Tabu Search Approach
• Crane scheduling with spatial constraints

Cited In (38)

• A fast heuristic for quay crane scheduling with interference constraints
• The quay crane scheduling problem with time windows
• Decomposition algorithms for the robust unidirectional quay crane scheduling problems
• 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
• Crane scheduling with spatial constraints
• A HEURISTIC SCHEDULING ALGORITHM FOR STEEL MAKING PROCESS WITH CRANE HANDLING(<Special Issue>Advanced Planning and Scheduling for Supply Chain Management)
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The terminal-oriented ship stowage planning problem
• A crane scheduling method for port container terminals
• How to park freight trains on rail-rail transshipment yards: the train location problem
• The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects
• 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
• Tabu search and iterated local search for the cyclic bottleneck assignment problem
• 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
• Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
• Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
• A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals
• Simulation-based optimization for discharge/loading operations at a maritime container terminal
• Principles and Practice of Constraint Programming – CP 2004
• A beam search algorithm for minimizing crane times in premarshalling problems
• A Benders decomposition-based framework for solving quay crane scheduling problems
• Scheduling for multi-robot routing with blocking and enabling constraints
• Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation
• Modeling and solving rich quay crane scheduling problems
• 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
• Scheduling double-track gantry cranes to minimize the overall loading/unloading time
• An integrated model for the transshipment yard scheduling problem
• Tabu search heuristics for the crane sequencing problem
• Determining crane areas in intermodal transshipment yards: the yard partition problem

Uses Software

• Tabu search

This page was built for publication: A tabu search heuristic for the quay crane scheduling problem

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