Multiple Resource Smoothing in Shipyard Planning.

Abstract

A heuristic approach for planning multiple resource workloads in project networks is discussed, with particular attention to ship overhaul planning. Projects are modeled using a critical-path-analysis activity network. Activity resource requirements are taken as given and activity loading is assumed to be constant. Activity duration variables are defined which then determine the demand rates per resource per activity. An iterative nonlinear programming procedure assigns activity durations (and consequently, activity resource demand rates) to minimize resource peaking subject to meeting project due dates. Computational experience is described for application to a major ship overhaul. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1981
Accession Number
ADA102160

Entities

People

  • Joerg Boysen
  • Robert C. Leachman

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Ground and Sea Platforms
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Classification
  • Coefficients
  • Computations
  • Computer Programming
  • Industrial Engineering
  • Linear Programming
  • Load Monitoring
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Production
  • Scheduling (Production)
  • Shipyards
  • Systems Engineering
  • Systems Science

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Defense Acquisition Program Management
  • Naval Engineering and Maritime Security