Optimization of temporal networks under uncertainty

✍ Scribed by Wolfram Wiesemann (auth.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2012
• Tongue: English
• Leaves: 421
• Series: Advances in Computational Management Science 11
• Edition: 1
• Category: Library

✦ Synopsis

Many decision problems in Operations Research are defined on temporal networks, that is, workflows of time-consuming tasks whose processing order is constrained by precedence relations. For example, temporal networks are used to model projects, computer applications, digital circuits and production processes. Optimization problems arise in temporal networks when a decision maker wishes to determine a temporal arrangement of the tasks and/or a resource assignment that optimizes some network characteristic (e.g. the time required to complete all tasks). The parameters of these optimization problems (e.g. the task durations) are typically unknown at the time the decision problem arises. This monograph investigates solution techniques for optimization problems in temporal networks that explicitly account for this parameter uncertainty. We study several formulations, each of which requires different information about the uncertain problem parameters.

✦ Table of Contents

Front Matter....Pages i-xi
Introduction....Pages 1-8
Background Theory....Pages 9-21
Maximization of the Net Present Value....Pages 23-52
Multi-Objective Optimization via Conditional Value-at-Risk....Pages 53-70
Minimization of Makespan Quantiles....Pages 71-103
Minimization of the Worst-Case Makespan....Pages 105-148
Back Matter....Pages 149-159

✦ Subjects

Operation Research/Decision Theory; Game Theory/Mathematical Methods; Optimization; Operations Research, Management Science