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-9781332901890
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-9781332901890
Quantité disponible : 15 disponible(s)
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book is an analysis of scheduling problems in manufacturing and computing. It explores the linear graph theory framework for understanding the sequencing of jobs through machines, framing these problems in terms of a novel approach of specifying scheduling constraints. The author demonstrates methods of constructing transitive graphs from component graphs by connecting components with directed branches. This allows the chains containing a given machine designation to be simply ordered, and the sets of jobs to have the same ordering as the component. This approach is novel as it allows for efficient algorithms for the construction of transitive graphs using digital computers, and facilitates the study of the construction and counting of transitive schedule graphs. By characterizing the properties of these graphs, the text makes an important contribution to understanding the relationship between technological ordering and the construction of feasible schedules, and in turn the study of the function of schedule time. 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 9781332901890_0
Quantité disponible : Plus de 20 disponibles