Excerpt from Some Problems in Linear Graph Theory That Arise in the Analysis of the Sequencing of Jobs Through Machines
A schedule is constructed from the technological ordering graphs by connecting the nodes for each machine station in a fashion which describes the order of the jobs through the machine station. For example, in figure 2 we have a schedule graph. Machine station 2 processes Job 3, then Job 4 then Job 2, and finally Job 1.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
EUR 1,92 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332901890
Quantità: 15 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332901890
Quantità: 15 disponibili
Da: Forgotten Books, London, Regno Unito
Paperback. Condizione: 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. Codice articolo 9781332901890_0
Quantità: Più di 20 disponibili