OPTIMAL SCHEDULING AND RESOURCE ALLOCATION IN PROJECT NETWORKS

A GENERAL MODEL FOR THE DISCRETE TIME/COST TRADEOFF PROBLEM WITH MULTIPLE RESOURCE CONSTRAINTS IS DEVELOPED. AN EXTENSIVE REVIEW OF MOST OF THE MODELS FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION PLACES THE TIME/COST TRADEOFF PROBLEM IN PERSPECTIVE. THE PROBLEM IS COMPLETELY DEFINED IN AN INTEGER PROGRAMMING FORMULATION FOLLOWED BY A DETAILED PRESENTATION OF THE BRANCH AND BOUND SOLUTION ALGORITHM. COMPUTATIONAL EXPERIENCE IS REPORTED AND IT IS COMPUTATIONALLY ECONOMICAL FOR MODERATE SIZE (100 ACTIVITIES) SCHEDULING PROBLEMS.

  • Corporate Authors:

    University of Illinois, Urbana-Champaign

    Department of Civil and Environmental Engineering
    205 North Mathews Avenue
    Urbana, IL  USA  61801-2352
  • Authors:
    • Chaker, A A
  • Publication Date: 1973-11

Media Info

  • Pagination: 155 p.
  • Serial:
    • Issue Number: 17

Subject/Index Terms

Filing Info

  • Accession Number: 00200641
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Apr 20 1974 12:00AM