Pages that link to "Item:Q3423263"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal (Q3423263):
Displayed 37 items.
- Hybrid evolutionary computation methods for quay crane scheduling problems (Q336440) (← links)
- Scheduling multiple factory cranes on a common track (Q337056) (← 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)
- 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)
- A tabu search heuristic for the quay crane scheduling problem (Q835567) (← links)
- A branch-and-cut algorithm for factory crane scheduling problem (Q897052) (← links)
- Container sequencing for quay cranes with internal reshuffles (Q989615) (← 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)
- Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level (Q1654372) (← 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 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)
- Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
- The role of operational research in green freight transportation (Q1755374) (← links)
- Modeling and solving rich quay crane scheduling problems (Q1761126) (← links)
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems (Q2150520) (← 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)
- 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)
- 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)
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research (Q3564376) (← links)
- Some complexity results and an efficient algorithm for quay crane scheduling problem (Q5298341) (← links)
- Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity (Q6109309) (← links)
- Robust optimization for the integrated berth allocation and quay crane assignment problem (Q6130707) (← links)
