Algorithm Design for an Online Berth Allocation Problem
In this paper, we investigate an online berth allocation problem, where vessels arrive one by one and their information is revealed upon arrival. Our objective is to design online algorithms to minimize the maximum load of all berths (makespan). We first demonstrate that the widely used Greedy algor...
Na minha lista:
| Principais autores: | , , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
MDPI AG
2024-09-01
|
| Serier: | Journal of Marine Science and Engineering |
| Fag: | |
| Online adgang: | https://www.mdpi.com/2077-1312/12/10/1722 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|