High Quality Content by WIKIPEDIA articles! 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. Different factors affect the berth and time assignment of each vessel. Among models found in the literature, there are four most frequently observed cases: a) discrete vs. continuous berthing space, b) static vs. dynamic vessel arrivals, c) static vs. dynamic vessel handling times, and d) variable vessel arrivals. In the discrete problem, the quay is viewed as a finite set of berths. In the continuous problem, vessels can berth anywhere along the quay and the majority of research deals with the former case. In the static arrival problem all vessels are already at the port whereas in the dynamic...

В наличии:
	Books.Ru - 873 руб.	Перейти
Под заказ:
	OZON.ru - 870 руб.	Перейти

Рейтинг книги: 4 из 5, 9 голос(-ов).