Berth allocation problem

The berth allocation problem (also known as the berth scheduling problem) is an 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...
Found on http://en.wikipedia.org/wiki/Berth_allocation_problem
No exact match found