ISBN: 9780792364863 - scheduling: control-based theory and polynomial-time algorithms (applied optimization, band 43) (12 Ergebnisse)

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. Attempts to systematically collect, classify, and solve various scheduling problems which could not be solved solely by combinatorics and mathematical programming. Addressing the theory and design of computer-based scheduling algorithms, this book is aimed at final-year undergraduates as well as Master and PhD students. Series: Applied Optimization. Num Pages: 407 pages, biography. BIC Classification: KJMV5; PDE; TBJ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 23. Weight in Grams: 752. . 2000. Hardback. . . . .…

Buch. Zustand: Neu. 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.…

Zustand: New. pp. 412.

Zustand: New. Attempts to systematically collect, classify, and solve various scheduling problems which could not be solved solely by combinatorics and mathematical programming. Addressing the theory and design of computer-based scheduling algorithms, this book is aimed at final-year undergraduates as well as Master and PhD students. Series: Applied Optimization. Num Pages: 407 pages, biography. BIC Classification: KJMV5; PDE; TBJ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 23. Weight in Grams: 752. . 2000. Hardback. . . . . Books ship from the US and Ireland.…

Gebunden. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 measu.…

Buch. Zustand: Neu. Scheduling: Control-Based Theory and Polynomial-Time Algorithms | E. Khmelnitsky (u. a.) | Buch | Applied Optimization | Einband - fest (Hardcover) | Englisch | 2000 | Springer US | EAN 9780792364863 | Verantwortliche Person für die EU: Springer Heidelberg, Tiergartenstr. 17, 69121 Heidelberg, buchhandel-buch[at]springer[dot]com | Anbieter: preigu Print on Demand. …

Buch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 412 pp. Englisch. …

Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 412 pp. Englisch.…

Zustand: New. Print on Demand pp. 412 Illus.

Zustand: New. PRINT ON DEMAND pp. 412.