Article ID: | iaor1998268 |
Country: | United States |
Volume: | 44 |
Issue: | 4 |
Start Page Number: | 301 |
End Page Number: | 318 |
Publication Date: | Jun 1997 |
Journal: | Naval Research Logistics |
Authors: | Lawphongpanich Siriphong, Brown Gerald G., Cormican Kelly J., Widdis Daniel B. |
Keywords: | scheduling |
Submarine berthing plans reserve mooring locations for inbound US Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, submarine berth shifting is expensive, labor intensive, and potentially hazardous. This article presents an optimization model for submarine berth planning and demonstrates it with Naval Submarine Base, San Diego. After a berthing plan has been approved and published, changed requests for services, delays, and early arrival of inbound submarines are routine events, requiring frequent revisions. To encourage trust in the planning process, the effect on the solution of revisions in the input is kept small by incorporating a persistence incentive in the optimization model.