A m‐parallel crane scheduling problem with a non‐crossing constraint
From MaRDI portal
Publication:5436474
DOI10.1002/nav.20189zbMath1126.90025OpenAlexW2141603040MaRDI QIDQ5436474
Andrew E. B. Lim, Brian Rodrigues, Zhou Xu
Publication date: 16 January 2008
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20189
Related Items (32)
A Benders decomposition-based framework for solving quay crane scheduling problems ⋮ The quay crane scheduling problem with time windows ⋮ Some complexity results and an efficient algorithm for quay crane scheduling problem ⋮ Approximation algorithm for uniform quay crane scheduling at container ports ⋮ Gauss‐Green theorem for weakly differentiable vector fields, sets of finite perimeter, and balance laws ⋮ A heuristic for the quay crane scheduling problem based on contiguous bay crane operations ⋮ A reclaimer scheduling problem arising in coal stockyard management ⋮ 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 ⋮ 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 ⋮ 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 ⋮ The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion ⋮ 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 ⋮ Scheduling small number of quay cranes with non-interference constraint ⋮ Container sequencing for quay cranes with internal reshuffles ⋮ 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 ⋮ AN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEM ⋮ Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles ⋮ Discrete time model and algorithms for container yard crane scheduling ⋮ 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
Cites Work
This page was built for publication: A m‐parallel crane scheduling problem with a non‐crossing constraint
