Pages that link to "Item:Q835567"
From MaRDI portal
The following pages link to A tabu search heuristic for the quay crane scheduling problem (Q835567):
Displaying 29 items.
- The terminal-oriented ship stowage planning problem (Q297116) (← links)
- Hybrid evolutionary computation methods for quay crane scheduling problems (Q336440) (← links)
- On double cycling for container port productivity improvement (Q338901) (← links)
- A heuristic for the quay crane scheduling problem based on contiguous bay crane operations (Q339620) (← 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)
- Container sequencing for quay cranes with internal reshuffles (Q989615) (← links)
- Simulation-based optimization for discharge/loading operations at a maritime container terminal (Q989637) (← 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)
- Tabu search and iterated local search for the cyclic bottleneck assignment problem (Q1652664) (← links)
- Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level (Q1654372) (← links)
- A generalized classification scheme for crane scheduling with interference (Q1698922) (← links)
- An integrated model for the transshipment yard scheduling problem (Q1707671) (← links)
- An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports (Q1730615) (← links)
- Modeling and solving rich quay crane scheduling problems (Q1761126) (← links)
- The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects (Q2030576) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel (Q2184047) (← links)
- Constraint programming models for integrated container terminal operations (Q2189889) (← links)
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports (Q2226489) (← 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)
- A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals (Q2286432) (← links)
- New bounds and algorithms for the transshipment yard scheduling problem (Q2434300) (← links)
- Determining crane areas in intermodal transshipment yards: the yard partition problem (Q2655623) (← links)
- The quay crane scheduling problem with time windows (Q2892125) (← links)
- Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation (Q4565264) (← links)
- Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity (Q6109309) (← links)
