| Summary: | 碩士 === 明志科技大學 === 工業工程與管理系碩士班 === 105 === Maintenance plans are important to prevent unscheduled down, especially in non-stop production environment. More maintenance means more man-hours needed and less production. In this paper we aim to schedule maintenance plan weekly, where the goal of the production department is the productive rate to meet the daily forecast arrival as much as possible, while the goal of the engineering department is the man-hours needed to meet the daily available man-hours as much as possible. The restrictions include time window of maintenance for each machine, at most out of machines can be schedule for maintenance, accompany maintenance constraints, daily available man-hours restriction. We illustrate the problem as a nonlinear integer programming model. Unfortunately, in real case application sometimes there would be no feasible solution. We therefore propose a genetic algorithm to find a maintenance plan, where penalty will be added to the fitness function whenever constraints were violated.
|
|---|
