Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

被引：0
作者：
Paolo Detti
机构：
[1] Università di Siena,Dipartimento di Ingegneria dell’Informazione
来源：
Journal of Scheduling | 2008年 / 11卷
关键词：
Multiprocessor scheduling; High multiplicity; Polynomial algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：7
相关论文
共 19 条
[1]  
Agnetis A.(2005)Asymptotic exact algorithm for the high multiplicity bin packing problem Mathematical Programming 104 21-37
[2]  
Filippi C.(2003)Optimal packet scheduling in UTRA-TDD IEEE Communications Letters 7 112-114
[3]  
Agnetis A.(2005)Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems Journal of Scheduling 8 255-273
[4]  
Brogi G.(2006)Carathéodory bounds for integer cones Operations Research Letters 34 564-568
[5]  
Ciaschetti G.(1999)Computing two-dimensional integers hulls SIAM Journal on Computing 6 2285-2299
[6]  
Detti P.(1991)Strongly polynomial algorithms for the high multiplicity scheduling problem Operations Research 4 648-653
[7]  
Giambene G.(1982)On scheduling independent tasks with restricted execution times Operations Research 1 163-171
[8]  
Detti P.(2001)A polynomial algorithm for multiprocessor scheduling with two job lengths Mathematics of Operations Research 26 31-49
[9]  
Agnetis A.(undefined)undefined undefined undefined undefined-undefined
[10]  
Ciaschetti G.(undefined)undefined undefined undefined undefined-undefined
12