An Algorithm for Constructing, Feasible Schedules and Computing

Jack Heller

ISBN 10: 1332086802 / ISBN 13: 9781332086801

Published by Forgotten Books, 2018

About this Item

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.

Seller Inventory # 9781332086801_0

Bibliographic Details

• Title: An Algorithm for Constructing, Feasible Schedules and Computing
• Publisher: Forgotten Books
• Publication Date: 2018
• Language: English
• ISBN 10: 1332086802
• ISBN 13: 9781332086801
• Binding: Paperback
• Condition: New
• Book Type: print-on-demand item
• Seller catalogs:
  • Calculus

About this title

Synopsis

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.