Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Oktober 2012
Genre:	Schulbücher
	C / Calculus of variations / Calculus of Variations and Optimal Control; Optimization / Calculus of Variations and Optimization / computer science / Computers / Decision Making / Management decision making / Mathematical optimization / Mathematical theory of computation / Mathematics and Statistics / Notation;Resolution;algorithms;efficiency;scheduling / Operational research / Operations Research / Operations Research and Decision Theory / Operations Research/Decision Theory / Optimization / Theory of Computation
ISBN:	9781461355748
EAN-Code:	9781461355748
Verlag:	Springer Nature EN
Einband:	Kartoniert
Sprache:	English
Serie:	#39 - International Series in Operations Research & Management Science
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	338 gr
Seiten:	198
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsible for the "hardness" of the scheduling problem. Chapters 6, 7, and 8 are dedicated to the resolution of several scheduling problems. These examples illustrate the use and the practical efficiency of the constraint propagation methods of the previous chapters. They also show that besides constraint propagation, the exploration of the search space must be carefully designed, taking into account specific properties of the considered problem (e.g., dominance relations, symmetries, possible use of decomposition rules). Chapter 9 mentions various extensions of the model and presents promising research directions.