Items related to An Algorithm for Constructing, Feasible Schedules and...
An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times (Classic Reprint) - Softcover
Synopsis
This book presents an algorithm for generating feasible schedules and a method for computing their completion times. The algorithm is based on the properties of directed linear graphs, which are linear graphs used to depict the precedence relations of jobs in a feasible schedule. Using the algorithm, the author determined the distribution of schedule times over the set of feasible schedules or subsets of feasible solutions for technological orderings that could occur in a general machine shop. These distributions are found to be approximately normal, but the author's numerical sampling experiments demonstrated that first come, first serve scheduling is the best method in terms of minimizing schedule completion time. The research presented in this book contributes to our understanding of scheduling problems and provides a practical tool for solving them.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 17.34
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for An Algorithm for Constructing, Feasible Schedules and...
Seller Image
An Algorithm for Constructing, Feasible Schedules and Computing
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book presents an algorithm for generating feasible schedules and a method for computing their completion times. The algorithm is based on the properties of directed linear graphs, which are linear graphs used to depict the precedence relations of jobs in a feasible schedule. Using the algorithm, the author determined the distribution of schedule times over the set of feasible schedules or subsets of feasible solutions for technological orderings that could occur in a general machine shop. These distributions are found to be approximately normal, but the author's numerical sampling experiments demonstrated that first come, first serve scheduling is the best method in terms of minimizing schedule completion time. The research presented in this book contributes to our understanding of scheduling problems and provides a practical tool for solving them. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332086801_0
Quantity: Over 20 available
Stock Image
An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332086801
Quantity: 15 available
Stock Image
An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332086801
Quantity: 15 available