| Summary: | 碩士 === 明志科技大學 === 工業工程與管理系碩士班 === 106 === Project scheduling is one of the key components in engineering management and has a significant effect on the overall cost. In business today, project managers have to manage several projects simultaneously and often face challenges with limited resources. In this paper, we propose a mixed integer linear programming formulation for the multiple project scheduling problem with a set of limited multiple resources to the identical activities within the same project or among different projects, and the objective is to minimize the maximum completion time (i.e., makespan) for all projects to be scheduled. The proposed model is based on the Activity on Arrow (AOA) networks, a two−stage approach is applied for obtaining the optimal activities scheduling. At the first stage, the minimum makespan for completing all projects is computed. By fixing the minimum completion time obtained from the first stage, the second stage computation is then to maximize the total slack time for all activities in order to obtain the effective start and finish time of each activity in constructing the multiple projects schedule. The experimental results have demonstrated practical viability of this approach.
|
|---|
