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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
Reseña del editor
This book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. This means that there are always processors (machines) in a set of resources which have to be allocated among tasks (jobs). Some problem parameters (e.g. task arrival times) may be unknown in advance, and then no knowledge-based approach is presented, creating a general tool for solving a broad class of practical problems. Most important classical results are surveyed with particular attention paid to single-processor scheduling. Then more general models are studied, including resource-constrained scheduling, flexible flow shops, dynamic job shops, and special flexible manufacturing systems. For the convenience of less advanced readers, basic concepts from scheduling theory and related areas (e.g. computational complexity analysis) are also described. Polynomial and exponential-time optimization algorithms, as well as approximation and heuristic ones are presented and discussed in the context of particular problems. For the presentation of algorithms a Pascal-like notation is adapted and used in almost all cases.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Scheduling in Computer and Manufacturing Systems
Foto des Verkäufers
Scheduling in Computer and Manufacturing Systems
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Verkäuferbewertung 5 von 5 Sternen
gebundene Ausgabe. Zustand: Gut. 2. Auflage;. 312 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 675. Artikel-Nr. 2235329
Gebraucht kaufen
EUR 110,00
Versand:
EUR 12,95
Von Deutschland nach USA
Anzahl: 1 verfügbar