An Algorithm for Constructing Feasible Schedules and Computing Their Schedule Times - George Logemann - Bog

This book presents an algorithm for constructing feasible schedules for a given set of tasks. The algorithm takes into account various constraints, such as time limits and resource availability, and computes the schedule times for each task. The book includes examples of how to implement the algorithm in different contexts, such as manufacturing, transportation, and project management.
This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it.
This work is in the "public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.
Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.