Research Reports from the Department of Operations
Document Type
Report
Publication Date
6-1-1975
Abstract
The paper concerns the problem of determining the shortest time of project completion under the constraint that the number of men available is less than the number of activities to be performed. Additionally, it is assumed that men differ in skills. In order to solve this problem, two related problems are formulated. The first one does not take into account the constraint that a man cannot perform more than one job at a time. The second one is discrete in time and is used to make a solution of the former problem feasible. An iterative procedure for solving the basic problem that makes use of solutions to these two problems is presented. Lower and upper bounds of the optimal solution are also determined. A numerical example is given to illustrate the approach used.
Keywords
Operations research, Assignment problems (Programming), Project management--Mathematical models, Time management, Resource allocation, Manpower planning, Mathematical optimization, Algorithms
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 357
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Kumar, S.; Wagner, D.; and Chandrasekaran, R., "Critical Path Problem Under Assignment Constraints with the Number of Men Less Than the Number of Activities" (1975). Research Reports from the Department of Operations. 118.
https://commons.case.edu/wsom-ops-reports/118