Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods

In this paper, we consider the problem of scheduling a set of M preventive maintenance tasks to be performed on M machines. The machines are assigned to execute production tasks. We aim to minimize the total preventive maintenance cost such that the maintenance tasks have to continuously be run duri...

Full description

Saved in:
Bibliographic Details
Published in:Journal of intelligent manufacturing 2012-08, Vol.23 (4), p.1207-1224
Main Authors: Rebai, Maher, Kacem, Imed, Adjallah, Kondo H.
Format: Article
Language:English
Subjects:
Algorithms
Branch and bound methods
Business and Management
Control
Cost control
Deviation
Heuristic
Heuristic methods
Job shops
Linear programming
Machinery
Machines
Maintenance costs
Maintenance management
Manufacturing
Mechatronics
Optimization
Preventive maintenance
Processes
Production
Production methods
Production scheduling
Robotics
Searching
Studies
Task scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we consider the problem of scheduling a set of M preventive maintenance tasks to be performed on M machines. The machines are assigned to execute production tasks. We aim to minimize the total preventive maintenance cost such that the maintenance tasks have to continuously be run during the schedule horizon. Such a constraint holds when the maintenance resources are not sufficient. We solve the problem by two exact methods and meta-heuristic algorithms. As exact procedures we used linear programming and branch and bound methods. As meta-heuristics, we propose a local search approach as well as a genetic algorithm. Computational experiments are performed on randomly generated instances to show that the proposed methods produce appropriate solutions for the problem. The computational results show that the deviation of the meta-heuristics solutions to the optimal one is very small, which confirms the effectiveness of meta-heuristics as new approaches for solving hard scheduling problems.
ISSN:0956-5515
1572-8145
DOI:10.1007/s10845-010-0425-0