Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

被引:4
|
作者
Detti, Paolo [1 ]
机构
[1] Univ Siena, Dipartimento Ingn Informaz, I-53100 Siena, Italy
关键词
multiprocessor scheduling; high multiplicity; polynomial algorithms;
D O I
10.1007/s10951-008-0054-z
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C = 2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.
引用
收藏
页码:205 / 212
页数:8
相关论文
共 50 条