Scheduling: Control-Based Theory and Polynomial-Time Algorithms

E. Khmelnitsky

ISBN 10: 1461371163 / ISBN 13: 9781461371168

Editore: Springer US, Springer New York, 2013

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial scheduling literature, the scheduling methodology suggested in this book is based on two mathematical tools - optimal control and combinatorics. Generally considered as belonging to two totally different areas of research and application, these seemingly irreconcilable tools can be integrated in a unique solution approach with the advantages of both. This new approach provides the possibility of developing effective polynomial-time algorithms to solve the generic scheduling problems. This book is aimed at a student audience - final year undergraduates as well as master and Ph.D. students, primarily in Operations Research, Management, Industrial Engineering and Control Systems. Indeed, some of the material in the book has formed part of the content of undergraduate and graduate courses taught at the Industrial Engineering Department of Tel-Aviv University, the Logistics Department of Bar-Ilan University and the Technology Management Department of Rolon Center for Technological Education, Israel. The book is also useful for practicing engineers interested in planning, scheduling and optimization methods. Since the book addresses the theory and design of computer-based scheduling algorithms, applied mathematicians and computer software specialists engaged in developing scheduling software for industrial engineering and management problems will find that the methods developed here can be embedded very efficiently in large applications.

Codice articolo 9781461371168

Dati bibliografici

• Titolo: Scheduling: Control-Based Theory and Polynomial-Time Algorithms
• Editore: Springer US, Springer New York
• Data di pubblicazione: 2013
• Lingua: Inglese
• ISBN 10: 1461371163
• ISBN 13: 9781461371168
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 23 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 23 millimetri di profondità
• Peso: 622 grammi

Descrizione articolo

Riassunto

This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial scheduling literature, the scheduling methodology suggested in this book is based on two mathematical tools - optimal control and combinatorics. Generally considered as belonging to two totally different areas of research and application, these seemingly irreconcilable tools can be integrated in a unique solution approach with the advantages of both. This new approach provides the possibility of developing effective polynomial-time algorithms to solve the generic scheduling problems. This book is aimed at a student audience - final year undergraduates as well as master and Ph.D. students, primarily in Operations Research, Management, Industrial Engineering and Control Systems. Indeed, some of the material in the book has formed part of the content of undergraduate and graduate courses taught at the Industrial Engineering Department of Tel-Aviv University, the Logistics Department of Bar-Ilan University and the Technology Management Department of Rolon Center for Technological Education, Israel. The book is also useful for practicing engineers interested in planning, scheduling and optimization methods. Since the book addresses the theory and design of computer-based scheduling algorithms, applied mathematicians and computer software specialists engaged in developing scheduling software for industrial engineering and management problems will find that the methods developed here can be embedded very efficiently in large applications.

Contenuti

Preface. Part I: Introduction. 1. Introduction to Control-Based Scheduling. 2. Mathematical Background. Part II: One-Machine, One-Product-Type Scheduling. 3. Unlimited Capacity Problems. 4. Limited Capacity Problems. Part III: Multiple Product-Type Scheduling. 5. One-Machine Problems. 6. Parallel Machine Problems. 7. Serial Machine Problems. Index.