Pages that link to "Item:Q513546"
From MaRDI portal
The following pages link to A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (Q513546):
Displaying 12 items.
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← 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)
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem (Q2300645) (← 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)
- Throughput optimization for the Robotic Cell Problem with Controllable Processing Times (Q4603940) (← links)
- The Dynamic Berth Allocation Problem: A linearized formulation (Q5501868) (← links)
- Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity (Q6109309) (← 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)