Explore how linear graphs model the sequencing of jobs through machines and learn how to build, count, and evaluate transitive scheduling structures.
This concise study connects practical scheduling problems to the theory of directed graphs. It introduces how jobs and machine stages can be represented as nodes and precedence relations, and it shows methods for constructing transitive graphs from components. You’ll see how to measure schedule efficiency with a recursive function and how bounds and counts guide algorithmic thinking for feasible schedules.
"synopsis" may belong to another edition of this title.
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780267867578
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780267867578
Quantity: 15 available