Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Scheduling Theory

Multi-Stage Systems
BuchKartoniert, Paperback
406 Seiten
Englisch
Springer Netherlandserschienen am08.10.2012Softcover reprint of the original 1st ed. 1994
In the eighties, the largest Russian publishing house for scientific literature Nauka Publishers, Moscow, issued two books by a group of Byelorussian mathematicians: Scheduling Theory.mehr
Verfügbare Formate
BuchGebunden
EUR106,99
BuchKartoniert, Paperback
EUR106,99
E-BookPDF1 - PDF WatermarkE-Book
EUR96,29

Produkt

KlappentextIn the eighties, the largest Russian publishing house for scientific literature Nauka Publishers, Moscow, issued two books by a group of Byelorussian mathematicians: Scheduling Theory.
Details
ISBN/GTIN978-94-010-4521-6
ProduktartBuch
EinbandartKartoniert, Paperback
Erscheinungsjahr2012
Erscheinungsdatum08.10.2012
AuflageSoftcover reprint of the original 1st ed. 1994
ReiheMathematics and Its Applications
Seiten406 Seiten
SpracheEnglisch
Gewicht668 g
IllustrationenVIII, 406 p.
Artikel-Nr.30370606

Inhalt/Kritik

Inhaltsverzeichnis
1 Flow Shop.- 1. Maximal Completion Time. Two Machines.- 2. Maximal Completion Time. Three and More Machines.- 3. Maximal Completion Time with No-Wait in Process.- 4. Maximal Lateness.- 5. Total Flow Time.- 6. Ordered Matrices of Processing Times.- 7. Dominant Matrices of Processing Times.- 8. Approximation Algorithms.- 9. Bibliography and Review.- 2 Job Shop.- 1. Optimal Processing of Two Jobs.- 2. Maximal Lateness.- 3. Maximal Completion Time. Equal Processing Times.- 4. Maximal Completion Time. Arbitrary Processing Times.- 5. Maximal Completion Time with No-Wait in Process.- 6. Bibliography and Review.- 3 Open Shop.- 1. Maximal Completion Time. Two Machines.- 2. Maximal Completion Time. Three and More Machines.- 3. Maximal Completion Time. Preemption.- 4. Maximal Completion Time. Precedence Constraints.- 5. Due Dates.- 6. Total Flow Time. Equal Processing Times.- 7. Total Flow Time. Arbitrary Processing Times.- 8. Bibliography and Review.- 4 Mixed Graph Problems.- 1. Network Representation of Processing Systems.- 2. Mixed Graphs.- 3. Branch-and-Bound Method.- 4. Optimization of Processing Systems.- 5. Stability of Optimal Schedules.- 6. Bibliography and Review.- References.- Additional References.- Also of interest.mehr
Kritik
` These two volumes dedicated to the theory and complexity of scheduling problems are a valuable source of information to researchers and graduate students of operations research, management, and computer sciences. Readers with particular interests in production planning and flexible manufacturing are very well served by this fine set. '
Journal of Global Optimization, 7, 1995
`The book is well written. ... Therefore, the book can be recommended for readers working in the field of scheduling and related areas from different points of view.'
Optimization, 37, 1996mehr