Berth allocation problem
The berth allocation problem (also known as the berth scheduling problem) is a NP-complete problem in operations research, regarding the allocation of berth space for vessels in container terminals. Vessels arrive over time and the terminal operator needs to assign them to berths to be served (loading and unloading containers) as soon as possible. Different factors affect the berth and time assignment of each vessel. Among models found in the literature, there are four most frequently observed cases: Some of the most notable objectives addressed in the literature are:
primaryTopic
Berth allocation problem
The berth allocation problem (also known as the berth scheduling problem) is a NP-complete problem in operations research, regarding the allocation of berth space for vessels in container terminals. Vessels arrive over time and the terminal operator needs to assign them to berths to be served (loading and unloading containers) as soon as possible. Different factors affect the berth and time assignment of each vessel. Among models found in the literature, there are four most frequently observed cases: Some of the most notable objectives addressed in the literature are:
has abstract
The berth allocation problem ( ...... s well as single and bi-level.
@en
Link from a Wikipage to an external page
Wikipage page ID
31,672,906
Wikipage revision ID
733,937,741
hypernym
type
comment
The berth allocation problem ( ...... dressed in the literature are:
@en
label
Berth allocation problem
@en