Scheduling Theory

Multi-Stage Systems

AvV. Tanaev,Yuri N. Sotskov

Inbunden, Engelska, 1994

Del i serien Mathematics and Its Applications

1 083 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

1 083 kr

Beskrivning

This volume is concerned with the problems of finding optimal schedules for systems comprising several sequential machines. More specifically, attention is largely given in separate chapters to three classical processing systems: the flow shop, the job shop and the open shop. A final chapter deals with mixed graph problems. Each of the four chapters concludes with a comprehensive bibliography and review. The volume also has an introduction and finishes with an extensive reference section. This volume is suitable for researchers and graduate students of management science and operations research interested in production planning and flexible manufacturing.

Produktinformation

Utgivningsdatum:1994-05-31
Mått:170 x 244 x 28 mm
Vikt:793 g
Format:Inbunden
Språk:Engelska
Serie:Mathematics and Its Applications
Antal sidor:406
Upplaga:1994
Förlag:Kluwer Academic Publishers
ISBN:9780792328544

Utforska kategorier

Recensioner i media

' 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, 1996

Innehållsförteckning

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.