Stock photo: cover may vary
Supervisory Control and Scheduling of Resource Allocation Systems: Reachability Graph Perspective (IEEE Press Series on Systems Science and Engineering) Hardback -
by Bo Huang; Mengchu Zhou
- New
- Hardback
A$227.19
A$5.72
Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Standard delivery: 9 to 14 days
Ships from Cold Books (New York, United States)
Details
- Title Supervisory Control and Scheduling of Resource Allocation Systems: Reachability Graph Perspective (IEEE Press Series on Systems Science and Engineering)
- Author Bo Huang; Mengchu Zhou
- Binding Hardback
- Condition New
- Pages 288
- Volumes 1
- Language ENG
- Publisher John Wiley & Sons
- Publication date
- Features Bibliography, Glossary, Index
- Bookseller's Inventory # 6377276734
- ISBN 9781119619680 / 1119619688
- Weight 1.21 lbs (0.55 kg)
- Dimensions 9 x 6 x 0.69 in (22.86 x 15.24 x 1.75 cm)
- Category Technology & Industrial Arts
- Library of Congress subjects Management information systems, Resource allocation - Decision making
- Library of Congress Catalogue Number 2020016184
- Dewey Decimal Code 658.403
- Quantity available 1
About Cold Books New York, United States
Reader reviews for Supervisory Control and Scheduling of Resource Allocation Systems: Reachability Graph Perspective (IEEE Press Series on Systems Science and Engineering)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
Presents strategies with reachability graph analysis for optimizing resource allocation systems
Supervisory Control and Scheduling of Resource Allocation Systems offers an important guide to Petri net (PN) models and methods for supervisory control and system scheduling of resource allocation systems (RASs). Resource allocation systems are common in automated manufacturing systems, project management systems, cloud data centers, and software engineering systems. The authors--two experts on the topic--present a definition, techniques, models, and state-of-the art applications of supervisory control and scheduling problems.
The book introduces the basic concepts and research background on resource allocation systems and Petri nets. The authors then focus on the deadlock-free supervisor synthesis for RASs using Petri nets. The book also investigates the heuristic scheduling of RASs based on timed Petri nets. Conclusions and open problems are provided in the last section of the book.
This important book:
- Includes multiple methods for supervisory control and scheduling with reachability graphs, and provides illustrative examples
- Reveals how to accelerate the supervisory controller design and system scheduling of RASs based on PN reachability graphs, with optimal or near-optimal results
- Highlights both solution quality and computational speed in RAS deadlock handling and system scheduling
Written for researchers, engineers, scientists, and professionals in system planning and control, engineering, operation, and management, Supervisory Control and Scheduling of Resource Allocation Systems provides an essential guide to the supervisory control and scheduling of resource allocation systems (RASs) using Petri net reachability graphs, which allow for multiple resource acquisitions and flexible routings.
