Scheduling jobs and maintenance activities on parallel machines

In this article, we deal with the problem of scheduling N production jobs on M parallel machines. Each machine should be maintained once during the planning horizon. We consider the case where the maintenance of the machines should start at time zero and the resources that ensure the maintenance are...

Full description

Saved in:
Bibliographic Details
Published in:Operational research 2013-10, Vol.13 (3), p.363-383
Main Authors: Rebai, Maher, Kacem, Imed, Adjallah, Kondo H.
Format: Article
Language:English
Subjects:
Business and Management
Computation
Computational Intelligence
Computer Science
Deadlines
Horizon
Integer programming
Linear programming
Maintenance
Maintenance costs
Management Science
Operations Research
Operations Research/Decision Theory
Optimization
Original Paper
Preventive maintenance
Production capacity
Production scheduling
Scheduling
Studies
Tasks
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 article, we deal with the problem of scheduling N production jobs on M parallel machines. Each machine should be maintained once during the planning horizon. We consider the case where the maintenance of the machines should start at time zero and the resources that ensure the maintenance are not sufficient. For such a reason, the maintenance tasks must be continuously run during the planning horizon. We aim to find a schedule composed of the production jobs and the maintenance tasks for which the total sum of the jobs’ weighted completion times and the preventive maintenance cost are minimized. We optimally solve the problem by an integer linear programming method. We also propose a heuristic method computed in two phases. Computational experiments are performed on randomly generated instances and the results show that the proposed methods produce satisfactory solutions for the problem.
ISSN:1109-2858
1866-1505
DOI:10.1007/s12351-012-0130-1