Stochastic makespan minimization in structured set systems
Stochastic makespan minimization in structured set systems
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a. the makespan). In this framework, we have a set of
n
tasks and
m
resources, where each task
j
uses some subset of the resources. Tasks have random sizes
X
j
, and our goal is to non-adaptively selec...
Alternative Titles
Full title
Stochastic makespan minimization in structured set systems
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2637650309
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2637650309
Other Identifiers
ISSN
0025-5610
E-ISSN
1436-4646
DOI
10.1007/s10107-021-01741-z
