Scheduling Computer and Manufacturing Processes (Hardcover)

Jacek Blazewicz

ISBN 10: 3540419314 / ISBN 13: 9783540419310

Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2001

Beschreibung

Hardcover. This book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. In such systems processors (machines) and possibly other resources are to be allocated among tasks in such a way that certain scheduling objectives are met. Various scheduling problems are discussed where different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factor are involved. Polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches (including tabu search, simulated annealing, genetic algorithms, and ejection chains) are presented and discussed. Moreover, resource-constrained, imprecise computation, flexible flow shop and dynamic job shop scheduling, as well as flexible manufacturing systems, are considered. In general, scheduling problems can be understood very broadly as the problems of allocating resources over time to perform a set of tasks being parts of some processes, among which computational and manufacturing ones are most important. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Bestandsnummer des Verkäufers 9783540419310

Bibliografische Details

• Titel: Scheduling Computer and Manufacturing Processes (Hardcover)
• Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
• Erscheinungsjahr: 2001
• Sprache: Englisch
• ISBN-10: 3540419314
• ISBN-13: 9783540419310
• Einband: Hardcover
• Auflage: 2. Auflage
• Zustand: new

Über diesen Titel

Inhaltsangabe

Written in a clear and concise manner this book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. Various scheduling problems are discussed where different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factor are involved. Polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches are presented and discussed. Moreover, resource-constrained, imprecise computation, flexible flow shop and dynamic job shop scheduling, as well as flexible manufacturing systems, are considered. An excellent analysis based on real-world applications with plenty of examples.