Items related to Scheduling: Control-Based Theory and Polynomial-Time...

Scheduling: Control-Based Theory and Polynomial-Time Algorithms: Control-Based Theory And Polynomial-Time Algorithms (Applied Optimization) - Softcover

 
Image Not Available

Synopsis

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.

"synopsis" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date2013
  • ISBN 10 1461371163
  • ISBN 13 9781461371168
  • BindingPaperback
  • LanguageEnglish
  • Number of pages407

Buy Used

Condition: As New
Like New
View this item

US$ 33.28 shipping from United Kingdom to U.S.A.

Destination, rates & speeds

Other Popular Editions of the Same Title

Image Not Available

Featured Edition

ISBN 10:  0792364864 ISBN 13:  9780792364863
Publisher: Springer, 2000
Hardcover

Search results for Scheduling: Control-Based Theory and Polynomial-Time...

Stock Image

Kogan, K.; Khmelnitsky, E.
Published by Springer, 2013
ISBN 10: 1461371163 ISBN 13: 9781461371168
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Mar2716030033620

Contact seller

Buy New

US$ 178.51
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Kogan, K.; Khmelnitsky, E.
Published by Springer, 2013
ISBN 10: 1461371163 ISBN 13: 9781461371168
New Softcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9781461371168_new

Contact seller

Buy New

US$ 190.92
Convert currency
Shipping: US$ 15.95
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

E. Khmelnitsky
Published by Springer US, 2013
ISBN 10: 1461371163 ISBN 13: 9781461371168
New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: 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. Seller Inventory # 9781461371168

Contact seller

Buy New

US$ 172.42
Convert currency
Shipping: US$ 35.42
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

E. Khmelnitsky
Published by Springer US Nov 2013, 2013
ISBN 10: 1461371163 ISBN 13: 9781461371168
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: 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. Seller Inventory # 9781461371168

Contact seller

Buy New

US$ 188.26
Convert currency
Shipping: US$ 26.20
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Seller Image

K. Kogan|E. Khmelnitsky
Published by Springer US, 2013
ISBN 10: 1461371163 ISBN 13: 9781461371168
New Softcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: 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. Seller Inventory # 4195263

Contact seller

Buy New

US$ 159.72
Convert currency
Shipping: US$ 55.80
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Kogan, K., Khmelnitsky, E.
Published by Springer, 2013
ISBN 10: 1461371163 ISBN 13: 9781461371168
Used Paperback

Seller: dsmbooks, Liverpool, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Paperback. Condition: Like New. Like New. book. Seller Inventory # D8F0-0-M-1461371163-6

Contact seller

Buy Used

US$ 251.21
Convert currency
Shipping: US$ 33.28
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

K. Kogan
Published by Springer, 2013
ISBN 10: 1461371163 ISBN 13: 9781461371168
New Paperback

Seller: Revaluation Books, Exeter, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback. Condition: Brand New. 407 pages. 9.30x6.20x0.90 inches. In Stock. Seller Inventory # x-1461371163

Contact seller

Buy New

US$ 272.50
Convert currency
Shipping: US$ 13.31
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket