Scheduling jobs and preventive maintenance activities on parallel machines

Authors:
Maher Rebai;Imed Kacem;Kondo H. Adjallah
Affiliations:
University of Technology of Troyes, Department of Industrial Systems, Troyes, France;University Paul Verlaine Metz, Department of Informatique, Metz, France;Ecole Nationale d'Ingnieurs de Metz, Electrical & Computer Engineering Dpt, Metz, France
Venue:
ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
Year:
2010

Citing 4
Cited 0

A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

Computers and Operations Research
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

Computers and Operations Research
Integrated production planning and preventive maintenance in deteriorating production systems

Information Sciences: an International Journal
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose in this study a hierarchical method for the problem of scheduling N jobs on M parallel machines where each machine should be maintained once during the planning horizon. The maintenance tasks should be continuously executed because the maintenance resources are not sufficient. Our objective is to find a schedule composed of the jobs and the maintenance tasks in which the total sum of the job's weighted completion times and the preventive maintenance cost are simultaneously minimized. The proposed hierarchical method is essentially based on a linear model and an Evolutionary algorithm. Computational experiments are performed on randomly generated instances. The results show that the proposed method is able to produce appropriate solutions for the problem.