Pages that link to "Item:Q1751714"
From MaRDI portal
The following pages link to Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714):
Displaying 11 items.
- Comparing an approximate queuing approach with simulation for the solution of a cross-docking problem (Q670435) (← links)
- Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level (Q1654372) (← links)
- The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach (Q1738835) (← links)
- Scheduling small number of quay cranes with non-interference constraint (Q2017842) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles (Q2307494) (← links)
- Crane scheduling with non-crossing constraint (Q3433502) (← links)
- A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint (Q5436474) (← links)
- Simultaneous operation of next-generation and traditional quay cranes at container terminals (Q6112695) (← links)
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions (Q6113444) (← links)
- Scheduling double-track gantry cranes to minimize the overall loading/unloading time (Q6542999) (← links)
