 |


|
 |
Item Details
Title:
|
OPTIMIZATION OF TEMPORAL NETWORKS UNDER UNCERTAINTY
|
By: |
Wolfram Wiesemann |
Format: |
Paperback |

List price:
|
£99.99 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
3642437230 |
ISBN 13: |
9783642437236 |
Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
Pub. date: |
22 February, 2014 |
Edition: |
2012 ed. |
Series: |
Advances in Computational Management Science 10 |
Pages: |
160 |
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. |
Illustrations: |
20 Tables, black and white; XII, 160 p. |
Publication: |
Germany |
Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
Returns: |
Returnable |
|
|
|
 |


|

|

|

|

|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.

|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...

|

|

|
|
 |