Pages that link to "Item:Q2480797"
From MaRDI portal
The following pages link to Operations research at container terminals: a literature update (Q2480797):
Displayed 50 items.
- A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Simulation of intermodal freight transportation systems: a taxonomy (Q1651692) (← links)
- A multi-objective approach for intermodal train load planning (Q1656424) (← links)
- Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm (Q1683073) (← links)
- Impact on yard efficiency of a truck appointment system for a port terminal (Q1686486) (← links)
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm (Q1694329) (← links)
- A generalized classification scheme for crane scheduling with interference (Q1698922) (← links)
- Real-time management of berth allocation with stochastic arrival and handling times (Q1707673) (← links)
- An average-case asymptotic analysis of the container relocation problem (Q1709944) (← links)
- New exact methods for the time-invariant berth allocation and quay crane assignment problem (Q1711448) (← links)
- Robust scheduling for berth allocation and quay crane assignment problem (Q1719234) (← links)
- Genetic algorithm and its performance analysis for scheduling a single crane (Q1723433) (← links)
- Scheduling cooperative gantry cranes with seaside and landside jobs (Q1744241) (← links)
- The load planning problem for double-stack intermodal trains (Q1754216) (← links)
- The role of operational research in green freight transportation (Q1755374) (← links)
- Modeling and solving rich quay crane scheduling problems (Q1761126) (← links)
- A tree search procedure for the container relocation problem (Q1761976) (← links)
- A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port (Q1926820) (← links)
- TOPSIS and AHP techniques for selecting the most efficient marine container yard gantry crane (Q1937856) (← links)
- Flexible space-sharing strategy for storage yard management in a transshipment hub port (Q1944872) (← links)
- Simultaneous berth allocation and yard planning at tactical level (Q1944874) (← links)
- Positioning of loading units in a transshipment yard storage area (Q1944878) (← links)
- Two-stage search algorithm for the inbound container unloading and stacking problem (Q1988734) (← links)
- An exact solution approach for scheduling cooperative gantry cranes (Q1991263) (← links)
- Scheduling small number of quay cranes with non-interference constraint (Q2017842) (← links)
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- Solution approaches for storage loading problems with stacking constraints (Q2027013) (← links)
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
- Routing two stacking cranes with predetermined container sequences (Q2059087) (← links)
- Twin-crane scheduling during seaside workload peaks with a dedicated handshake area (Q2124909) (← links)
- Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals (Q2147157) (← links)
- Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey (Q2158003) (← links)
- A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals (Q2163853) (← links)
- Pilotage planning in seaports (Q2189919) (← links)
- Interference aware scheduling of triple-crossover-cranes (Q2197327) (← links)
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports (Q2226489) (← links)
- Ship routing using genetic algorithms (Q2241313) (← links)
- Optimal berth allocation and time-invariant quay crane assignment in container terminals (Q2256246) (← links)
- Exact and heuristic methods for placing ships in locks (Q2256280) (← links)
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports (Q2256282) (← links)
- Storage yard operations in container terminals: literature overview, trends, and research directions (Q2256283) (← links)
- An exact method for scheduling a yard crane (Q2256284) (← links)
- A mathematical model of inter-terminal transportation (Q2256285) (← links)
- A fast heuristic for quay crane scheduling with interference constraints (Q2268514) (← links)
- A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals (Q2286432) (← links)
- Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading (Q2293995) (← links)
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem (Q2294635) (← links)
- Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles (Q2307494) (← links)
- Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas (Q2315629) (← links)