TY  - JOUR
T1  - A Linear Programming Approach for the Project Controlling
AU - Khalaf, Wakas S. AU - Wah June, Leong 
JO  - Research Journal of Applied Sciences
VL  - 4
IS  - 5
SP  - 202
EP  - 212
PY  - 2009
DA  - 2001/08/19
SN  - 1815-932x
DO  - rjasci.2009.202.212
UR  - https://makhillpublications.co/view-article.php?doi=rjasci.2009.202.212
KW  - Linear programming
KW  -CPM
KW  -time-cost trade-off
KW  -least cost-scheduling
KW  -cost optimization
KW  -project compression
AB  - One of the most challenging jobs that any manager can take on is the management of a large-scale project that requires coordinating numerous activities throughout the organization. A myriad of details must be considered in planning how to coordinate all these activities, in developing a realistic schedule and then in monitoring the progress of the project. The main aim of this study is on using Linear Programming (LP) technique to build two models. The first is to find the duration of project completion (critical path or Longest route of a unit flow entering at the start node and terminating at the finish node). The second model is built because sometimes it is required to complete a project within the predetermined deadline to keep cost at lowest possible level. Failure to do so ultimately leads to increase in total cost. This would let managers to encounter a decision situation, which activities of the project will be crashed to minimize the total cost of crashing. Thus, the second model is minimizing the cost of crashing the project’s activities to meet the desired project completion time. We use a software package (Win.QSB) to deal with all the data needed to develop schedule information and then to monitor the progress of the project. Finally, we provide a combined report of the problem via analysis the results that obtained from solving these two models to give us some flexibility in planning, scheduling and controlling.
ER  -