| Summary: | 碩士 === 明志科技大學 === 工業工程與管理研究所 === 101 === Project scheduling is one of the key components in the construction industry 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 research, we propose two mixed integer linear programming formulations for the multiple projects scheduling problem, one is for the projects without due dates and the other is for the projects with due dates, while a set of limited resources to the identical activities within the same project or among different projects. For the projects without due dates, the objective is to minimize the maximum completion time (makespan), and for the projects with due dates, the objective is to minimize the total crash cost. The proposed models are 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 or the minimum total crash cost for completing all projects is computed. By fixing the minimum completion time or minimum total crash cost 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.
|
|---|
