On-line Multi-threaded Scheduling

被引：0

作者：

Esteban Feuerstein

Marcelo Mydlarz

Leen Stougie

机构：

[1] Universidad de Buenos Aires,Departamento de Computación, Facultad de Ciencias Exactas y Naturales

[2] Rutgers University,Department of Computer Science

[3] Technical University Eindhoven,Combinatorial Optimization Group, Faculty of Mathematics

[4] Centre for Mathematics and Computer Science (CWI),undefined

来源：

Journal of Scheduling | 2003年 / 6卷

关键词：

on-line algorithms; multiple threads; competitive analysis; scheduling problems;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

On-line scheduling problems are studied with jobs organized in a number of sequences called threads. Each job becomes available as soon as a scheduling decision is made on all preceding jobs in the same thread.

引用

页码：167 / 181

页数：14

共 11 条

[1]

Bartal Y.(1995)New algorithms for an ancient scheduling problem J. Comput. Syst. Sci. 51 359-366

[2]

Fiat A.(2000)On-line scheduling revisited J. Sched. 3 343-353

[3]

Karloff H.(1966)Bounds for certain multiprocessing anomalies Bell Syst. Tech. J. 45 1563-1581

[4]

Vohra R.(1996)A better algorithm for an ancient scheduling problem J. Algorithms 20 400-430

[5]

Fleischer R.(1956)Various optimizers for single-stage production Naval Res. Logistics Q. 3 59-66

[6]

Wahl M.(undefined)undefined undefined undefined undefined-undefined

[7]

Graham R. L.(undefined)undefined undefined undefined undefined-undefined

[8]

Karger D. R.(undefined)undefined undefined undefined undefined-undefined

[9]

Philips S. J.(undefined)undefined undefined undefined undefined-undefined

[10]

Torng E.(undefined)undefined undefined undefined undefined-undefined

← 1 2 →