Optimization of Temporal Networks under Uncertainty

Wolfram Wiesemann

ISBN 10: 3642437230 / ISBN 13: 9783642437236

Published by Springer Berlin Heidelberg, 2014

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783642437236

Bibliographic Details

• Title: Optimization of Temporal Networks under Uncertainty
• Publisher: Springer Berlin Heidelberg
• Publication Date: 2014
• Language: English
• ISBN 10: 3642437230
• ISBN 13: 9783642437236
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 10D millimeters 235 millimeters width by 155 millimeters height by 10 millimeters depth
• Weight: 271 grams

About this title

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.