Verwandte Artikel zu An Algorithm for Constructing, Feasible Schedules and...
An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times (Classic Reprint) - Softcover
Inhaltsangabe
Excerpt from An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times
Lacking a practical algorithm to solve sequencing problemsll], for example the problem of finding a minimum schedule for the processing of Job Operations through a given set of machines, one must rely heavily upon simulation and sampling techniques.
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
Excerpt from An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times
Lacking a practical algorithm to solve sequencing problemsll], for example the problem of finding a minimum schedule for the processing of Job Operations through a given set of machines, one must rely heavily upon simulation and sampling techniques.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 18,77
EUR 0,85 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für An Algorithm for Constructing, Feasible Schedules and...
Beispielbild für diese ISBN
An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times Classic Reprint
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332086801
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332086801
Anzahl: 15 verfügbar
Foto des Verkäufers
An Algorithm for Constructing, Feasible Schedules and Computing
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781332086801_0
Anzahl: Mehr als 20 verfügbar