期刊
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
卷 67, 期 5-8, 页码 1127-1137出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00170-012-4553-x
关键词
Scheduling; Preventive maintenance; Deterioration; Genetic algorithms; Discrete optimization
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据