| نویسندگان | Hamid R. Golmakani, Ali Namazi |
|---|---|
| نشریه | Journal of Quality in Maintenance Engineering |
| نوع مقاله | Full Paper |
| تاریخ انتشار | 2012 |
| رتبه نشریه | علمی - پژوهشی |
| نوع نشریه | چاپی |
| کشور محل چاپ | بریتانیا |
چکیده مقاله
Purpose – In many manufacturing systems, machines are subject to preventive maintenance. This paper aims to schedule the operations of jobs and preventive maintenance tasks in such a way that the completion time of jobs and preventive maintenance tasks is minimized.
Design/methodology/approach – A heuristic approach based on artificial immune algorithm is proposed for solving the multiple route job shop scheduling problem subject to i) fixed periodic and ii) age-dependent preventive maintenance tasks. Under fixed periodic assumption, the time between two consecutive preventive maintenance tasks is assumed constant. Under age-dependent assumption, a preventive maintenance task is triggered if the machine operates for a certain amount of time. The goal is to schedule the jobs and preventive maintenance task subject to makespan minimization.
Findings – In addition to presenting mathematical formulation for the multiple route job shop scheduling problem, this paper proposes a novel approach by which one can tackle the complexity that is raised in scheduling and sequencing the jobs and the preventive maintenance simultaneously and obtain the required schedule in reasonable time.
Practical implications – Integrating preventive maintenance tasks into the scheduling procedure is vital in many manufacturing systems. Using the proposed approach, one can obtain a schedule that defines the production route through which each part is processed, the time each operation must be started, and when preventive maintenance must be carried out on each machine. This, in turn, results in overall manufacturing cost reduction.
Originality/value – Using the approach proposed in this paper, good solution, if not optimal, can be obtained for scheduling jobs and preventive maintenance task in one of the most complicated job shop configuration, namely, multiple route job shop. Thus, the approach can dominate all other simpler configurations.