Pages that link to "Item:Q2341106"
From MaRDI portal
The following pages link to A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results (Q2341106):
Displaying 15 items.
- Multiple-vendor, multiple-retailer based vendor-managed inventory (Q271946) (← links)
- An integrated supply chain problem: a nested Lagrangian relaxation approach (Q492808) (← links)
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (Q513546) (← links)
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (Q742501) (← links)
- A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
- Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse (Q1683060) (← links)
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem (Q1694325) (← links)
- The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion (Q1753475) (← links)
- Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems (Q2150520) (← links)
- Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles (Q2307494) (← links)
- A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem (Q2337546) (← links)
- Modeling and solution of the joint quay crane and truck scheduling problem (Q2514750) (← links)
- On the berth allocation problem (Q2826660) (← links)
- An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study (Q2969974) (← links)
- The Dynamic Berth Allocation Problem: A linearized formulation (Q5501868) (← links)
