Pages that link to "Item:Q5436474"

The following pages link to A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint (Q5436474):

Displaying 32 items.

• A heuristic for the quay crane scheduling problem based on contiguous bay crane operations (Q339620) (← links)
• A reclaimer scheduling problem arising in coal stockyard management (Q341465) (← links)
• How to park freight trains on rail-rail transshipment yards: the train location problem (Q443824) (← links)
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (Q742501) (← links)
• On-line scheduling with non-crossing constraints (Q957355) (← links)
• Container sequencing for quay cranes with internal reshuffles (Q989615) (← links)
• Discrete time model and algorithms for container yard crane scheduling (Q1027603) (← links)
• A survey of berth allocation and quay crane scheduling problems in container terminals (Q1040981) (← links)
• A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
• A generalized classification scheme for crane scheduling with interference (Q1698922) (← links)
• An integrated model for the transshipment yard scheduling problem (Q1707671) (← links)
• Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion (Q1753475) (← links)
• Modeling and solving rich quay crane scheduling problems (Q1761126) (← links)
• Scheduling small number of quay cranes with non-interference constraint (Q2017842) (← links)
• Levelling crane workload in multi-yard rail-road container terminals (Q2030338) (← links)
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
• Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel (Q2184047) (← links)
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem (Q2255903) (← links)
• A fast heuristic for quay crane scheduling with interference constraints (Q2268514) (← links)
• Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading (Q2293995) (← links)
• Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles (Q2307494) (← links)
• The crane scheduling problem: models and solution approaches (Q2393470) (← links)
• New bounds and algorithms for the transshipment yard scheduling problem (Q2434300) (← links)
• Operations research at container terminals: a literature update (Q2480797) (← links)
• Determining crane areas in intermodal transshipment yards: the yard partition problem (Q2655623) (← links)
• The quay crane scheduling problem with time windows (Q2892125) (← links)
• Approximation algorithm for uniform quay crane scheduling at container ports (Q3178146) (← links)
• Vehicle Routing Problems and Container Terminal Operations – An Update of Research (Q3564376) (← links)
• AN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEM (Q3632031) (← links)
• Some complexity results and an efficient algorithm for quay crane scheduling problem (Q5298341) (← links)
• Gauss‐Green theorem for weakly differentiable vector fields, sets of finite perimeter, and balance laws (Q5302719) (← links)