Abstract
This paper investigates the solution of manufacturing scheduling problems using different distributed computing schemes. The focus of this paper is on determining the statistically significant effects of a distributed computer model with respect to elapsed solution time and the amount of problem space investigated. Statistical inferences are drawn with respect to the number of processors and how the problem is partitioned. The best combinations of the number of processors and partitioning schemes are presented with respect to problem scenario and size. Additionally, comparisons are made with respect to the performance of different configurations of the distributed computer model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
