共 50 条
Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity
被引:23
|作者:
Zhu, Zhanguo
[1
,2
,5
]
Chu, Feng
[3
]
Sun, Linyan
[2
]
Liu, Ming
[4
]
机构:
[1] Nanjing Agr Univ, Coll Econ & Management, Nanjing 210095, Jiangsu, Peoples R China
[2] Xi An Jiao Tong Univ, Sch Management, State Key Lab Mech Mfg Syst Engn, Key Lab,Minist Educ Proc Control & Efficiency Eng, Xian 710049, Shaanxi Provinc, Peoples R China
[3] Univ Evry Val dEssonne, Lab Informat Biol Integrat & Syst Complexes IBISC, EA 4526, F-91020 Evry, France
[4] Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China
[5] Univ Technol Troyes, Inst Charles Delaunay, FRE CNRS 2848, LOSI, F-10010 Troyes, France
基金:
美国国家科学基金会;
关键词:
Scheduling;
Rate-modifying activity;
Resource allocation;
Learning effect;
DUE-DATE ASSIGNMENT;
PROCESSING-TIMES;
MAINTENANCE ACTIVITY;
WINDOW ASSIGNMENT;
COMPLETION-TIME;
FLOW TIME;
D O I:
10.1016/j.apm.2012.09.072
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
This paper addresses a single machine scheduling problem in which the actual job processing times are determined by resource allocation function, its position in a sequence and a rate-modifying activity simultaneously. We discuss two objective functions with two resource allocation functions under the consideration of a rate-modifying activity. We show that the problems are solvable in O(n(4)) time for a linear resource allocation function and are solvable in O(n(2)logn) time for a convex resource allocation function. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:5371 / 5380
页数:10
相关论文