Scheduling the maintenance on a single machine

Scheduling the maintenance on a single machine

0.00 Avg rating0 Votes
Article ID: iaor20003329
Country: United Kingdom
Volume: 50
Issue: 10
Start Page Number: 1071
End Page Number: 1078
Publication Date: Oct 1999
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: scheduling
Abstract:

This paper considers a single machine scheduling problem with preventive maintenance. In many cases, a machine must be maintained after it continuously works for a period of time. But most papers in the literature ignore non-availability of the machine. For this reason, this paper studies the problem of scheduling processing of jobs and maintenance of machine simultaneously. The objective is to minimise total completion time of jobs. The problem is proved to be NP-hard in the strong sense. Three heuristic algorithms and a branch and bound algorithm are proposed. Computational experiments are done to evaluate the effectiveness of the algorithms.

Reviews

Required fields are marked *. Your email address will not be published.