Machine scheduling problems with a learning effect

被引:0
作者
Zhao, CL [1 ]
Zhang, QL
Tang, HY
机构
[1] Northeastern Univ, Coll Sci, Shenyang 110004, Peoples R China
[2] Shenyang Normal Univ, Dept Math, Shenyang 110034, Peoples R China
来源
DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES A-MATHEMATICAL ANALYSIS | 2004年 / 11卷 / 5-6期
关键词
scheduling; learning; single machine; parallel machines; flow shop;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper deals with the machine scheduling problems with a learning effect. In a learning effect environment,the machine improves continuously as a result of-repeating the same or similar jobs;hence the later a given job is scheduled in the sequence,the shorter its processing time. We introduce polynomial solutions for some single machine problems, parallel machines problems and flow shop problems. The objective functions, including makespan, (weighted) sum of completion times,maximum lateness are discussed respectively.
引用
收藏
页码:741 / 750
页数:10
相关论文
共 10 条