Pages that link to "Item:Q2337546"
From MaRDI portal
The following pages link to A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem (Q2337546):
Displaying 11 items.
- 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)
- An integrated model for berth and yard planning in container terminals with multi-continuous berth layout (Q1730671) (← links)
- Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals (Q2147157) (← links)
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760) (← links)
- Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading (Q2293995) (← links)
- Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
- Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles (Q2307494) (← links)
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results (Q2341106) (← links)
- Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization (Q6619608) (← links)
- An optimization model with a Lagrangian relaxation algorithm for artificial Internet of things-enabled sustainable circular supply chain networks (Q6658358) (← links)
