| The Berth Scheduling Problem (BSP) deals with the assignment of vessels to berths in a marine terminal, with the objective to maximize the ocean carriers’ satisfaction (minimize delays) and/or minimize the terminal operator’s costs. In the existing literature, two main assumptions are made regarding the status of a vessel: a) either all the vessels to be served are already in the port before the planning period starts, or b) they are scheduled to arrive after the planning period starts. The latter case assumes an expected time of arrival for each vessel which is a function of the departure time of the vessel from the previous port, the average operating speed, and the distance between the two ports. Recent increases in fuel prices have forced ocean carriers to reduce current operating speeds, while stressing to the terminal operators the need to maintain the integrity of their schedule. In addition, several collaborative efforts between the industry and government agencies have been proposed aiming to reduce emissions from marine vessels and port operations. In light of these issues, this paper presents a berth scheduling policy to minimize vessel delayed departures and indirectly reduce the fuel consumption and emissions produced by the vessels while in idle mode. Vessel arrival times are considered as a variable and are optimized to accommodate the objectives of the proposed policy while providing ocean carriers with an optimized vessel speed. Example problems using real world data show that the proposed policy reduces the amount of emissions produced by vessels at the port in idle mode, optimizes fuel consumption and waiting time at the port by reducing vessel operating speeds to optimal levels and minimizes the effects of late arrivals to the ocean carriers’ schedule. |