A single-machine scheduling problem with maintenance activities to minimize makespan

A single-machine scheduling problem with maintenance activities to minimize makespan

0.00 Avg rating0 Votes
Article ID: iaor2010836
Volume: 215
Issue: 11
Start Page Number: 3929
End Page Number: 3935
Publication Date: Feb 2010
Journal: Applied Mathematics and Computation
Authors: , ,
Keywords: maintenance, repair & replacement, programming: integer
Abstract:

We study a single-machine scheduling problem with periodic maintenance activity under two maintenance stratagems. Although the scheduling problem with single or periodic maintenance and nonresumable jobs has been well studied, most of past studies considered only one maintenance stratagem. This research deals with a single-machine scheduling problem where the machine should be stopped for maintenance after a fixed periodic interval (T) or after a fixed number of jobs (K) have been processed. The objective is to minimize the makespan for the addressed problem. A two-stage binary integer programming (BIP) model is provided for driving the optimal solution up to 350-job instances. For the large-sized problems, two efficient heuristics are provided for the different combinations of T and K. Computational results show that the proposed algorithm Best-Fit-Butterfly (BBF) performs well because the total average percentage error is below 1%. Once the constraint of the maximum number of jobs (K) processed in the machine's available time interval (T) is equal or larger than half of jobs, the heuristic Best-Fit-Decreasing (DBF) is strongly recommended.

Reviews

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