A heuristic for a scheduling problem with communication delays
成果类型：
Article
署名作者：
Munier, A; Konig, JC
署名单位：
Universite Paris Saclay
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.45.1.145
发表日期：
1997
页码：
145-147
关键词：
摘要：
This paper addresses a scheduling problem with interprocessor communication delays: the jobs and the communication delays are of unit length. The number of processors is unbounded. The aim is to minimize the makespan. We develop a new list scheduling heuristic and we prove that its worst-case relative performance is 4/3.