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

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.