Scheduling in Computer and Manufacturing Systems

Jacek Blazewicz

ISBN 10: 3642790364 / ISBN 13: 9783642790362

Verlag: Springer Berlin Heidelberg, 2011

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - Let us start with the description of the purpose of this book. First we should explain how we understand its tide. In general, scheduling problems can be understood very broadly as the problems of the allocation of resources over time to perform a set of tasks. By resources we understand arbitrary means tasks compete for. They can be of a very different nature, e.g. manpower, money, processors (machines), energy, tools. Also tasks can have a variety of interpretations starting from machining parts in manu facturing systems up to processing information in computer systems. The same is true for task characteristics, e. g. ready times, due dates, relative urgency weights, functions describing task processing in relation to allotted resources. Moreover, a structure of a set of tasks, reflecting precedence constraints among them, can be defined in different ways. In addition, different criteria which measure the quality of the performance of a set of tasks can be taken into account.

Bestandsnummer des Verkäufers 9783642790362

Bibliografische Details

• Titel: Scheduling in Computer and Manufacturing Systems
• Verlag: Springer Berlin Heidelberg
• Erscheinungsjahr: 2011
• Sprache: Englisch
• ISBN-10: 3642790364
• ISBN-13: 9783642790362
• Einband: Taschenbuch
• Auflage: 2. Auflage
• Zustand: Neu
• Abmessungen: 244B x 170 H x 18 T Millimeter Breite: 244 mm, Höhe: 170 mm, Tiefe: 18 mm
• Gewicht: 568 Gramm

Über diesen Titel

Inhaltsangabe

A theoretical and application-oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. The important classical results are surveyed with particular attention paid to single-processor scheduling, along with general models such as resource-constrained scheduling, flexible flow shops, dynamic job shops, and special flexible manufacturing systems. Polynomial and exponential-time optimization algorithms as well as approximation and heuristic ones are presented using a Pascal-like notation, before being discussed in the light of particular problems. Basic concepts from scheduling theory and related fields are described to assist less advanced readers.