Distributed computing approaches toward manufacturing scheduling problems

This paper investigates the solution of manufacturing scheduling problems using different distributed computer schemes. The distributed computer schemes vary with respect to task partitioning, task allocation and the number of processors used. The best combinations of these variations are presented with respect to problem scenario and size. The distributed computing models are analyzed with respect to computational advantages gained vs. traditional computing models. The models are implemented over a distributed computer network, designed for heterogeneous application, and are transportable to other operating systems and networks of computers. The advantages of these models are discussed and several useful extensions are presented.