The digital edition of all books may be viewed on our website before purchase. Excerpt from An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times (Classic Reprint)
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 1,06 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332086801
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332086801
Quantité disponible : 15 disponible(s)
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : 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. N° de réf. du vendeur 9781332086801_0
Quantité disponible : Plus de 20 disponibles