Annual Scheduling of Atlantic Fleet Surface Combatants

Download
Author
Brown, Gerald G.
Goodman, Clark E.
Wood, R. Kevin
Date
1990Metadata
Show full item recordAbstract
Employment scheduling is the process whereby U. S. Navy ships, submarines, aircraft and other units are assigned to
major operations, exercises, maintenance periods, inspections and other events; the employment schedule directly
influencesfleet combat readiness. Currently, this process is largely manual requiring several full-time scheduling officers
and additional personnel at various levels of management. We introduce an optimization model that automates a
substantial part of the employment scheduling problem. The model is formulated as a generalized set partitioning
problem and is applied to the annual planning schedule for naval surface combatants of the Atlantic Fleet. For the
calendar year 1983, 111 ships engage in 19 primary events yielding a model 'with 228 constraints and 10,723 binary
variables. This model is solved optimally in about 1.6 minutes producing a schedule that is significantly better than the
corresponding published schedule.
Description
Operations Research, 38, pp. 249-259.
Rights
defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
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 ... -
Static scheduling of conditional branches in parallel programs
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, ... -
NTDS computer facilities scheduling system: Final report
Hartman, James K.; Howard, Gilbert Thoreau (Monterey, California. Naval Postgraduate School, 1977-12); NPS55-77-45This report investigates the scheduling of Naval Tactical Data Systems (NTDS) mockups and the associated computer facilities at FCDSSA/FCDSTCP, San Diego. We provide a design for an automated, computer based, interactive ...