An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times (Classic Reprint) - Hardcover

Jack Heller

9780267732197: An Algorithm for Constructing, Feasible Schedules and Computing, Their Schedule Times (Classic Reprint)

Hardcover

ISBN 10: 0267732198 ISBN 13: 9780267732197

Publisher: Forgotten Books, 2018

View all copies of this ISBN edition

0 Used

2 New

From US$ 31.82

Efficiently turn complex job orders into feasible schedules with a proven algorithm.

This edition explains how a recursive method condenses large graphs into a single workable schedule, and how to compute both completion times and overall schedule length.

In clear, practical steps, the text shows how to model scheduling problems with linear graphs and how to transform those graphs into a ready-to-run algorithm. It also covers how to handle real-world constraints, verify feasibility, and compare different scheduling approaches using numerical experiments.

Understand the graph-based representation of precedence and processing
Learn how the algorithm builds a feasible schedule from partially ordered data
See how to compute individual start and finish times for each operation
Explore how randomized and bias-driven strategies affect schedule quality

Ideal for readers seeking a rigorous, application-focused look at constructing schedules and estimating their times, this edition suits students and professionals alike.

"synopsis" may belong to another edition of this title.