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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9783639158762
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9783639158762
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9783639158762
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783639158762_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783639158762
Quantité disponible : 10 disponible(s)
Vendeur : moluna, Greven, Allemagne
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Kraemer JanDr. Jan Kraemer is a postdoctoral researcher at the Faculty ofnEconomics and Business Engineering at the University ofnKarlsruhe, Germany, from where he also obtained a diploma degreenin Business Engineering in 2005 and a do. N° de réf. du vendeur 4962726
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book studies exact solution procedures for theso-called Conference Scheduling Problem (CSP), whichseeks to minimize the duration of a conference, wheresome of the activities cannot be held concurrently.The CSP corresponds to non-preemptive scheduling ofindependent activities with dedicated resources andconstitutes a special case within the more generalResource Constraint Project Scheduling Problem(RCPSP) as well as the machine scheduling framework,and as such it is NP-hard. The core characteristicsof CSP are commonly encountered in problems ofdifferent domains and therefore the problem is ofhigh practical relevance.The book focuses on the analysis and comparison ofgraph-based solution procedures, which operate on aconstrained graph that is derived from theconfliciting acitivies to be scheduled. In particularInterval Coloring and Comparability GraphAugmentation are considered. An emphasis is put onthe investigation of variations of the latterprocedure, which exploits the structure of theconstraint graph and is therefore robust tovariations in the activity durations. N° de réf. du vendeur 9783639158762
Quantité disponible : 2 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. The Conference Scheduling Problem | Graph-Based Exact Scheduling Procedures of Independent Activities with Dedicated Resources | Jan Krämer | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2009 | VDM Verlag Dr. Müller | EAN 9783639158762 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu. N° de réf. du vendeur 101567068
Quantité disponible : 5 disponible(s)