DYNAMIC PROGRAMMING APPROACH TO SCHEDULING OF NONSERIAL LINEAR PROJECT

A nonserial dynamic programming formulation for scheduling linear projects with nonsequential activities is presented. The ability to handle both serial and nonserial linear projects with activities performed with variable crew formations is a major advantage of this approach. The formulation derives an optimum crew size for production activities that leads to minimum project total cost. An example illustrates the computational steps, validates the calculation algorithm, and demonstrates the capabilities of the proposed procedure.

Language

  • English

Media Info

  • Features: Appendices; Figures; References; Tables;
  • Pagination: p. 106-114
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00721070
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 11 1996 12:00AM