Berth allocation problem
Encyclopedia
The berth allocation problem is an NP-complete
NP-complete
In computational complexity theory, the complexity class NP-complete is a class of decision problems. A decision problem L is NP-complete if it is in the set of NP problems so that any given solution to the decision problem can be verified in polynomial time, and also in the set of NP-hard...

 problem in operations research
Operations research
Operations research is an interdisciplinary mathematical science that focuses on the effective use of technology by organizations...

, regarding the allocation of berth space for vessels in container terminal
Container terminal
A container terminal is a facility where cargo containers are transshipped between different transport vehicles, for onward transportation. The transshipment may be between container ships and land vehicles, for example trains or trucks, in which case the terminal is described as a maritime...

s.
The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK