TEST - Catálogo BURRF
   

Optimization of Temporal Networks under Uncertainty / by Wolfram Wiesemann.

Por: Colaborador(es): Tipo de material: TextoTextoSeries Advances in Computational Management Science ; 11Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Descripción: xI, 159 páginas 42 ilustraciones recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783642234279
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • HD30.23
Recursos en línea: Resumen: 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.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha