Scheduling precedence-constrained jobs with Stochastic processing times on parallel machines

被引:0
|
作者
Skutella, M [1 ]
Uetz, M [1 ]
机构
[1] Tech Univ Berlin, Fachbereich Math, D-10623 Berlin, Germany
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider parallel machine scheduling problems where the jobs are subject to precedence constraints, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the weighted sum of job completion times Sigma(j) w(j) C-j in expectation, where w(j) greater than or equal to 0. Building upon an LP-relaxation from [3] and an idle time charging scheme from [1], we derive the first approximation algorithms for this model.
引用
收藏
页码:589 / 590
页数:2
相关论文
共 50 条