Crane scheduling with non-crossing constraint
From MaRDI portal
Publication:3433502
DOI10.1057/palgrave.jors.2602110zbMath1123.90042OpenAlexW2002163559MaRDI QIDQ3433502
No author found.
Publication date: 30 April 2007
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602110
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (30)
A Benders decomposition-based framework for solving quay crane scheduling problems ⋮ The quay crane scheduling problem with time windows ⋮ A grasp-knapsack hybrid for a nurse-scheduling problem ⋮ A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals ⋮ A reclaimer scheduling problem arising in coal stockyard management ⋮ Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey ⋮ The crane scheduling problem: models and solution approaches ⋮ Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel ⋮ 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 ⋮ The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach ⋮ Vehicle Routing Problems and Container Terminal Operations – An Update of Research ⋮ Approximate the scheduling of quay cranes with non-crossing constraints ⋮ On-line scheduling with non-crossing constraints ⋮ 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 ⋮ Simulation-based optimization for discharge/loading operations at a maritime container terminal ⋮ Modelling and metaheuristic for gantry crane scheduling and storage space allocation problem in railway container terminals ⋮ A Bottleneck Matching Problem with Edge-Crossing Constraints ⋮ Levelling crane workload in multi-yard rail-road container terminals ⋮ Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading ⋮ A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules ⋮ Scheduling of a single crane in batch annealing process ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Uses Software
This page was built for publication: Crane scheduling with non-crossing constraint
