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
来源：
PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2001年
关键词：
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 条
  • [1] Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
    Maiti, Biswaroop
    Rajaraman, Rajmohan
    Stalfa, David
    Svitkina, Zoya
    Vijayaraghavan, Aravindan
    [J]. 2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 834 - 845
  • [2] Precedence-Constrained Scheduling of Malleable Jobs with Preemption
    Makarychev, Konstantin
    Panigrahi, Debmalya
    [J]. AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 823 - 834
  • [3] Multiprocessor Scheduling of Precedence-constrained Mixed-Critical Jobs
    Socci, Dario
    Poplavko, Peter
    Bensalem, Saddek
    Bozga, Marius
    [J]. 2015 IEEE 18TH INTERNATIONAL SYMPOSIUM ON REAL-TIME DISTRIBUTED COMPUTING (ISORC), 2015, : 198 - 207
  • [4] Lower bounds on precedence-constrained scheduling for parallel processors
    Baev, ID
    Meleis, WM
    Eichenberger, A
    [J]. INFORMATION PROCESSING LETTERS, 2002, 83 (01) : 27 - 32
  • [5] Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds
    Chudak, FA
    Shmoys, DB
    [J]. JOURNAL OF ALGORITHMS, 1999, 30 (02) : 323 - 343
  • [6] Lower bounds on precedence-constrained scheduling for parallel processors
    Baev, ID
    Meleis, WM
    Eichenberger, A
    [J]. 2000 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS, 2000, : 549 - 553
  • [7] SCHEDULING JOBS WITH EXPONENTIAL PROCESSING TIMES ON PARALLEL MACHINES
    LEHTONEN, T
    [J]. JOURNAL OF APPLIED PROBABILITY, 1988, 25 (04) : 752 - 762
  • [8] SCHEDULING OF PRECEDENCE-CONSTRAINED PARALLEL PROGRAM TASKS ON MULTIPROCESSORS
    MURTHY, CSR
    MURTHY, KNB
    SREENIVAS, A
    [J]. MICROPROCESSING AND MICROPROGRAMMING, 1993, 36 (02): : 93 - 104
  • [9] Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds
    Chudak, FA
    Shmoys, DB
    [J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 581 - 590
  • [10] SCHEDULING JOBS WITH EXPONENTIALLY DISTRIBUTED-PROCESSING TIMES AND INTREE PRECEDENCE CONSTRAINTS ON 2 PARALLEL MACHINES
    PINEDO, M
    WEISS, G
    [J]. OPERATIONS RESEARCH, 1985, 33 (06) : 1381 - 1388
12345