运筹与管理2011，Vol.20Issue(2)：97-101,5.
具有指数和位置学习效应的机器排序问题
Some Scheduling Problems With Exponential Time-dependent and Position-based Learning Effect
摘要
Abstract
In this paper, we introduce a new scheduling model in which both exponential time-dependent learning effect and position-based learning effect exist simultaneously.The actual processing time of a job depends not only on an exponent function of the total normal processing time of the already processed jobs but also on its scheduled position.For the single-machine case, we derive polynomial-time optimal solutions for the problems to minimize makespan and the total completion time.In addition, we also show that the total weighted completion time problem and the maximum lateness problem can be solved in polynomial time under certain conditions.For the case of m-machine permutation flowshop, we present polynomial-time optimal for some special cases of the problems to minimize makespan and the total completion time.关键词
排序/单机排序/流水机排序/学习效应Key words
scheduling/ single-machine/ flowshop/ learning effect分类
数理科学引用本文复制引用
张新功,严广乐,唐国春,唐海波..具有指数和位置学习效应的机器排序问题[J].运筹与管理,2011,20(2):97-101,5.基金项目
上海市重点学科(S30504),中港联合科研基金(20710015),上海市研究生教育创新计划资助(JWCXSL1001) （S30504）
