期刊
INFORMATION PROCESSING LETTERS
卷 110, 期 11, 页码 460-463出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2010.04.015
关键词
Scheduling; Learning effect; Rate-modifying activity
资金
- Hong Kong Polytechnic University [G-YX0G]
- National Natural Science Foundation of China [10801121]
- Science Fund for Young Scholars of Zhejiang Gongshang University [Q09-21]
We consider a scheduling problem with job-dependent learning effects and multiple rate-modifying activities. The learning effects manifest such that the processing time of a job is a decreasing function of its position in a sequence. By job-dependent learning effects, we mean that the learning of the jobs is different. A rate-modifying activity is an activity that changes the production rate of a machine. So the actual processing time of a job in our problem is a variable, which depends not only on its position in a sequence but also on whether it is scheduled before or after a rate-modifying activity. We assume that each machine may have multiple rate-modifying activities. The objective is to minimize the total completion time. We show that all the cases of the problem are polynomially solvable. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据