Optimal ship berthing plans
Thurman, Katie Podolak
Brown, Gerald G.
MetadataShow full item record
A ship berthing plan assigns surface vessels a berth prior to their port entrance, or reassigns ships once in port to allow them to accomplish in a timely manner maintenance, training, and certification events which build readiness for future operational commitments. Each ship requires different services when in port, such as shore power, crane services, ordnance, and fuel. Unfortunately, not all services are offered at all piers. At present, ship berthing plans are manually prepared by a port operations scheduler and often result in unnecessary berth shifts, which puts ships out of action for several hours. An extensive user-friendly computerized optimization model is developed and tested to assist the schedulers in the creation of berthing plan which minimizes port loading conflicts, thus promoting fleet readiness through berthing stability. Norfolk Naval Station is used. Keywords: Port loading; Berthing plans; Port berthing; Military thesis; Ship berthing plans; Ship berthing; Berth scheduling; Ship scheduling; Supply replenishment. (kt)
Showing items related by title, author, creator and subject.
Dowler, Richard C. (Monterey, California. Naval Postgraduate School, 1992-09);A database management system, the Naval Postgraduate School Scheduling System (NPS3), is proposed to support the Naval Postgraduate School schedulers in scheduling academic events and courses for students, instructors and ...
Analysis of Current Flight Scheduling Practices and Recommendations to Efficiently Reduce Deviations from Syllabus Time-To-Train Hall, Bentley (Tyler); Hargrove, Hayward (Trey); Willis, James (Marshall) (Monterey, California. Naval Postgraduate School, 2011-09-07);EXECUTIVE SUMMARY: The objective of our project is to investigate current scheduling requirements, constraints, and procedures to identify problems with scheduling practices and syllabus management for Primary Flight ...
George, Robert Tyler (Monterey, California. Naval Postgraduate School, 1996-12);The problem of scheduling parallel program tasks on multiprocessor systems is known to be NP-complete in its general form. When non-determinism is added to the scheduling problem through loops and conditional branching, ...