Pages that link to "Item:Q2393470"

The following pages link to The crane scheduling problem: models and solution approaches (Q2393470):

Displaying 35 items.

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals (Q319438) (← links)
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (Q513546) (← links)
• CLSS: An intelligent crane lorry scheduling system (Q702818) (← links)
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (Q742501) (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
• Solution techniques for a crane sequencing problem (Q843376) (← links)
• A branch-and-cut algorithm for factory crane scheduling problem (Q897052) (← links)
• A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level (Q1654372) (← links)
• Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse (Q1683060) (← links)
• Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm (Q1683073) (← links)
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem (Q1694325) (← links)
• A generalized classification scheme for crane scheduling with interference (Q1698922) (← links)
• An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports (Q1730615) (← links)
• An integrated model for berth and yard planning in container terminals with multi-continuous berth layout (Q1730671) (← links)
• Scheduling quay cranes and yard trucks for unloading operations in container ports (Q1730674) (← links)
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach (Q1738835) (← links)
• An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
• Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems (Q2150520) (← links)
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results (Q2341106) (← links)
• Container vessel scheduling with bi-directional flows (Q2643792) (← links)
• An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes (Q2669644) (← links)
• Pallet location and job scheduling in a twin-robot system (Q2676351) (← links)
• The quay crane scheduling problem with time windows (Q2892125) (← links)
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
• Crane scheduling with spatial constraints (Q3156730) (← links)
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures (Q3423265) (← links)
• Crane scheduling with non-crossing constraint (Q3433502) (← links)
• Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex (Q3601205) (← links)
• Crane scheduling with time windows in circuit board production lines (Q4398967) (← links)
• Interblock Crane Deployment in Container Terminals (Q4411214) (← links)
• A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint (Q5436474) (← links)
• Principles and Practice of Constraint Programming – CP 2004 (Q5900334) (← links)
• An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints (Q6065832) (← links)