Stochastic Machine Scheduling with Precedence Constraints

We consider parallel, identical machine scheduling problems, where the jobs are subject to precedence constraints and release dates, and where the processing times of jobs are governed by independent probability distributions. Our objective is to minimize the expected value of the total weighted com...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	SIAM journal on computing Ročník 34; číslo 4; s. 788 - 802
Hlavní autoři:	Skutella, Martin, Uetz, Marc
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2005
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Computer science; control theory; systems Computer systems performance. Reliability Exact sciences and technology Expected values Job shops Linear programming Mathematical programming Operational research and scientific management Operational research. Management science R&D Random variables Release dates Research & development Schedules Scheduling Scheduling, sequencing Software Theoretical computing precedence constraints 68Q25 68W40 LP relaxation Parallel machines Linear programming Processing time Stochastic scheduling Probability distribution Scheduling list scheduling algorithms 68W25 90C05 approximation algorithms Approximation algorithm Precedence constraint Delay 90B36 release dates Distribution function LP-relaxation 68M20
ISSN:	0097-5397, 1095-7111
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!