| Summary: | 碩士 === 國立臺北科技大學 === 工業工程與管理系所 === 104 === Scheduling jobs with machine maintenance in a manufacturing system has received considerable attention from researchers in the recent decades. In this study, we investigate some single-machine scheduling problems with a variable maintenance activity, which must start before a given deadline, and the maintenance duration is a non-decreasing function of the starting time of maintenance. This study presents polynomial-time algorithms to solve the problems in order to minimize the objectives of mean lateness, maximum tardiness, total flow time, and mean tardiness. The four addressed single-machine scheduling problems are significant but have not yet been investigated topics. With no research has been done on these problems, the results of this work would increase the applications of scheduling theory in industry.
|
|---|
