A Naval Shipyard Optimal Drydock Loading and Capacity Utilization Model

Abstract

The Naval Shipyard Optimal Drydock Loading and Capacity Utilization Model presented in this thesis is a tool to optimally load the Naval Shipyard's drydocks. The problem is constrained by the length, type and timing of each ship's required maintenance; current and projected capabilities of existing drydocks; current load of the drydocks; and the requirement to perform maintenance on the drydocks. Prior to this model, the Navy used a suboptimal, manual procedure that took one to two weeks to perform. This inefficiency became critical when an Assistant Secretary of the Navy requested a drydock capacity utilization study, requiring optimal loadings under numerous scenarios. An optimization model which lacks limiting assumptions, allows easy modification of input data and is capable of quick analysis of drydock loading scenarios was developed and executed fast enough to provide timely answers. It is implemented via the General Algebraic Modeling System (GAMS). Data management and interface with the GAMS software is controlled via the Naval Shipyard Drydock Loading and Capacity Utilization Program (a stand-alone program written in Microsoft QBasic) . Naval Shipyard Drydocks, Drydock Loading, Optimal Drydock Loading, Drydock Capacity Utilization.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1992
Accession Number
ADA257322

Entities

People

  • Richard A. Brown

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • California
  • Classification
  • Computer Programming
  • Data Management
  • Databases
  • Financial Management
  • Force Structure
  • Maintenance
  • Naval Operations
  • Navy
  • Operations Research
  • Optimization
  • Schools
  • Security
  • United States
  • United States Naval Academy
  • User Interface

Fields of Study

  • Engineering

Readers

  • Computer Science.
  • Logistics and Supply Chain Management.
  • Naval Architecture and Marine Engineering.