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)
Multiple Resource Smoothing in Shipyard Planning
1981
29 pages
Report
No indication
English
Management Practice , Marine Engineering , Scheduling , Nonlinear programming , Resource management , Mathematical models , Shipyards , Heuristic methods , Numerical methods and procedures , Parameters , Input output processing , Algorithms , Dynamic programming , CPM(Critical Path Methods) , NTISDODXA
Planning builds shipyard backlog
Engineering Index Backfile | 1956
Shipyard Planning Model Feasibility Study
NTIS | 1979
|Production Planning System for Oppama Shipyard
British Library Conference Proceedings | 1994
|Discrete Event Simulation for Strategic Shipyard Planning
TIBKAT | 2019
|Shipyard Focus - Halifax Shipyard prepares for combat
Online Contents | 2013