The Conference Scheduling Problem: Graph-Based Exact Scheduling Procedures of Independent Activities with Dedicated Resources - Tapa blanda

Krämer, Jan

 
9783639158762: The Conference Scheduling Problem: Graph-Based Exact Scheduling Procedures of Independent Activities with Dedicated Resources
Tapa blanda
ISBN 10: 3639158768 ISBN 13: 9783639158762
Editorial: VDM Verlag, 2009

Sinopsis

This book studies exact solution procedures for the so-called Conference Scheduling Problem (CSP), which seeks to minimize the duration of a conference, where some of the activities cannot be held concurrently. The CSP corresponds to non-preemptive scheduling of independent activities with dedicated resources and constitutes a special case within the more general Resource Constraint Project Scheduling Problem (RCPSP) as well as the machine scheduling framework, and as such it is NP-hard. The core characteristics of CSP are commonly encountered in problems of different domains and therefore the problem is of high practical relevance. The book focuses on the analysis and comparison of graph-based solution procedures, which operate on a constrained graph that is derived from the confliciting acitivies to be scheduled. In particular Interval Coloring and Comparability Graph Augmentation are considered. An emphasis is put on the investigation of variations of the latter procedure, which exploits the structure of the constraint graph and is therefore robust to variations in the activity durations.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

This book studies exact solution procedures for the so-called Conference Scheduling Problem (CSP), which seeks to minimize the duration of a conference, where some of the activities cannot be held concurrently. The CSP corresponds to non-preemptive scheduling of independent activities with dedicated resources and constitutes a special case within the more general Resource Constraint Project Scheduling Problem (RCPSP) as well as the machine scheduling framework, and as such it is NP-hard. The core characteristics of CSP are commonly encountered in problems of different domains and therefore the problem is of high practical relevance. The book focuses on the analysis and comparison of graph-based solution procedures, which operate on a constrained graph that is derived from the confliciting acitivies to be scheduled. In particular Interval Coloring and Comparability Graph Augmentation are considered. An emphasis is put on the investigation of variations of the latter procedure, which exploits the structure of the constraint graph and is therefore robust to variations in the activity durations.

Biografía del autor

Dr. Jan Krämer is a postdoctoral researcher at the Faculty of Economics and Business Engineering at the University of Karlsruhe, Germany, from where he also obtained a diploma degree in Business Engineering in 2005 and a doctorate degree in Economics in 2007.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
VDM Verlag
Año de publicación
2009
Idioma
Inglés
ISBN 10 
3639158768
ISBN 13 
9783639158762
Encuadernación
Tapa blanda
Número de páginas
160
Contacto del fabricante
no disponible
Persona responsable
no disponible