Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 67, Issue 5-8, Pages 1127-1137Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00170-012-4553-x
Keywords
Scheduling; Preventive maintenance; Deterioration; Genetic algorithms; Discrete optimization
Ask authors/readers for more resources
In this paper, we study a single machine scheduling problem with deteriorating processing time of jobs and multiple preventive maintenances which reset deteriorated processing time to the original processing time. In this situation, we consider three kinds of problems whose performance measures are makespan, total completion time, and total weighted completion time. First, we formulate integer programming formulations, and using the formulations, one can find optimal solutions for small problems. Since these problems are known to be NP-hard and the size of real problem is very large, we propose a number of heuristics and design genetic algorithms for the problems. Finally, we conduct some computational experiments to evaluate the performance of the proposed algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available