期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 80, 期 -, 页码 195-200出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2014.12.009
关键词
DeJong's learning effect; Makespan; Total completion time; FPTAS
资金
- National Social Science Foundation of China [14CGL071]
- Humanities and Social Sciences Planning Foundation of the Ministry of Education [13YJA630034]
- Contemporary Business and Trade Research Center of Zhejiang Gongshang University, key Research Institute of Social Sciences and Humanities of the Ministry of Education
We consider a relatively new learning model in scheduling based on DeJong's learning effect. Compared with the classical learning model for scheduling, this model is more general and realistic. The objectives are to minimize makespan and total completion time. For the single-machine case, we show that both of the objectives are polynomially solvable. For the parallel-machine case, we show that minimizing total completion time is still polynomially solvable, while minimizing makespan is NP-hard, for which we provide a fully polynomial-time approximation scheme (FPTAS). (C) 2014 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据