Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
25.05.2009
Verlag
VDMSeitenzahl
160
Maße (L/B/H)
22/15/1 cm
Gewicht
256 g
Sprache
Englisch
ISBN
978-3-639-15876-2
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.
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.
Ein neues Kapitel für Ihre Bücher
Ein neues Kapitel für Ihre Bücher
Schenken Sie Ihren alten Schätzen ein zweites Leben: Einfach Barcode scannen, Versandetikett ausdrucken, Bücher verschicken und Thalia Geschenkkarte erhalten.
Jetzt verkaufenNoch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.
Kurze Frage zu unserer Seite
Vielen Dank für Ihr Feedback
Wir nutzen Ihr Feedback, um unsere Produktseiten zu verbessern. Bitte haben Sie Verständnis, dass wir Ihnen keine Rückmeldung geben können. Falls Sie Kontakt mit uns aufnehmen möchten, können Sie sich aber gerne an unseren Kund*innenservice wenden.
zum Kundenservice