This thesis presents Projects Scheduling Heuristic Algorithm (PSHA) using Wiest's simple heuristic concept as a basis for the production scheduling in the job shop under fixed resource constraints.
The PSHA can handle multiple resource demands, and schedules each activity on daily basis under the assumptions of constant resource demand rates and available amounts. It is not allowed to split an activity, and parallel scheduling method is used with 5 different priority rules.
Through case studies applying PSHA to the production scheduling of the overhead crane process in a large Korean firm, practical applications of PSHA will be shown and be compared and evaluated with the PERT/CPM result. Also, a suitable application for resource leveling will be discussed.
The PSHA approach has shown its superior practicability and many advantages, like effective resource utilization and analysis of the causes of due date slippage, in the production scheduling and it can be a promising scheduling technique in the job shop.
