| Summary: | 碩士 === 國立中央大學 === 工業管理研究所 === 104 === In this paper we consider the problem of scheduling of n nonresumable jobs on m identical parallel machines with deteriorating and flexible maintenance activities, and the objective is to minimize total completion time. In this paper scheduling, each machine is not continuously available. The machine must be maintained to prevent breakdown of machine and keep the quality of process jobs. In the past studies, the period maintenance activities is the main object. The period maintenance activity must be maintained after it continuously working for a period of time. In a recent year, develop to constraint of flexible maintenance in order to promote the efficient of machines. The flexible maintenance which means the starting time of unavailability period are decision variable together with jobs to be scheduled .This study given the minimum and maximum working time within any two consecutive maintenance activities correspond with flexible maintenance activity . In addition to constraint of flexible maintenance, correspond with manufacturing environment, we add the constraint of deteriorating maintenance. The deteriorating maintenance assume that the duration of each maintenance activity time depends on the running time.
We propose a branch and bound algorithm to find the optimal solution. According to five propositions, lower bound and upper bound to promote the efficient of algorithm. Finally, we use computational analysis to calculate the optimal solution.
|
|---|
