Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 21,67
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 20,45
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Forgotten Books, London, Reino Unido
EUR 15,04
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: 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.