| Summary: | 碩士 === 國立中央大學 === 工業管理研究所 === 105 === In this article, we consider the problem of scheduling n resumable jobs on the m identical parallel machine with flexible maintenance activities and sequence independent setup time, and the objective is to minimize total completion of jobs. In this past, the majority of scheduling studies assumes that machines are continuously at all time. If a job is disrupted during processing by a disrupted machine and it does not need (need) to restart after the machine becomes available again, it is called the resumable (nonresumable) case. In recent year, more and more studies consider that each machine is not continuously available. Flexible maintenance activity constraints mean that each machine must be maintained after a continuous period of time to prevent machine failure and maintain the quality of the process. This study considers the minimum working time and maximum working time within any two consecutive maintenance activities. We develop a branch and bound algorithm and a greedy algorithm and try to find the optimal solution in our problem.
Keywords: Scheduling, identical parallel machine, flexible maintenance, resumable job, independent setup time, branch and bound, iterated greedy algorithm, total completion time.
|
|---|
