Pages that link to "Item:Q1707825"
From MaRDI portal
The following pages link to Mathematical models for the berth allocation problem in dry bulk terminals (Q1707825):
Displaying 13 items.
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations (Q322604) (← links)
- Berth allocation with time-dependent physical limitations on vessels (Q421704) (← links)
- The berth allocation problem: models and solution methods (Q1424376) (← links)
- The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm (Q1738818) (← links)
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
- Tandem queues in bulk port operations (Q1977982) (← links)
- The berth allocation problem in terminals with irregular layouts (Q1991240) (← links)
- The consecutive multiprocessor job scheduling problem (Q2178063) (← links)
- A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
- Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports (Q2398778) (← links)
- Terminal allocation problem in a transshipment hub considering bunker consumption (Q4632873) (← links)
- Scheduling of waterways with tide and passing box (Q6051583) (← links)
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem (Q6164375) (← links)