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)


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Multiple Resource Smoothing in Shipyard Planning


    Contributors:
    R. C. Leachman (author) / J. Boysen (author)

    Publication date :

    1981


    Size :

    29 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    Planning builds shipyard backlog

    Engineering Index Backfile | 1956


    Shipyard Planning Model Feasibility Study

    J. H. Herd / W. T. Towles / J. W. Willyard | NTIS | 1979


    Production Planning System for Oppama Shipyard

    Amemiya, T. | British Library Conference Proceedings | 1994


    Discrete Event Simulation for Strategic Shipyard Planning

    Jeong, Yong-Kuk / Shen, Huiqiang / Kim, Youngmin et al. | TIBKAT | 2019