期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 58, 期 2, 页码 199-211出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2009.04.014
关键词
Scheduling problems; Availability constraints; Algorithms
Various deterministic scheduling problems with availability constraints motivated by preventive maintenance attract more and more researchers. Many results involving this constraint have been published in recent years. But there is no recent paper to summarize them. To be convenient for interested researchers, we make this survey. in this paper, complexity results, exact algorithms and approximation algorithms in single machine, parallel machine, flow shop, open shop, job shop scheduling environment with different criteria are Surveyed briefly. (C) 2009 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据