Unrelated parallel-machine scheduling with controllable processing time

被引:0
|
作者
Hsu, Chia-Lun [1 ,2 ]
Taur, Jin-Shiuh [2 ]
机构
[1] Chung Shan Inst Sci & Technol, Aeronaut Syst Res Div, Taichung 402, Taiwan
[2] Chung Shan Inst Sci & Technol, Dept Elect Engn, Taichung 402, Taiwan
关键词
Scheduling; Assignment problem; Controllable processing time; Resource allocation; Unrelated parallel-machine; SEQUENCING PROBLEMS; EXTENSIONS; JOBS;
D O I
10.4028/www.scientific.net/AMM.321-324.1993
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper explores an unrelated parallel-machine resource allocation scheduling problem with controllable processing time. The objective is to minimize the cost function containing the weighted of total load, total completion time, total absolute deviation of completion time, and total compression cost. We show that the proposed problem is polynomial time solvable. We also discuss a special case of the problem and show that it can be optimally solved by lower order algorithm.
引用
收藏
页码:1993 / +
页数:3
相关论文
共 50 条