期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 117, 期 -, 页码 1-5出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.01.002
关键词
Scheduling; Single-machine; Group technology; Makespan; Total completion time; Learning effect; Aging effect
资金
- Zhejiang Provincial Educational Commission Foundation of China [Y201738850]
- Hong Kong Polytechnic University under the Fung Yiu King - Wing Hang Bank Endowed Professorship in Business Administration
- Zhejiang Provincial Natural Science Foundation of China [LQ15G010001, LR15G010001]
- Contemporary Business and Trade Research Center of Zhejiang Gongshang University, key Research Institute of Social Sciences and Humanities of the Ministry of Education
We propose new models of position-dependent processing times for single-machine group scheduling problems. The two objectives of the scheduling problems are to minimize the makespan and the total completion time, respectively. We present polynomial-time algorithms to solve the problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
