Distributed scheduling of job shops
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1067-1072 vol.2
- https://doi.org/10.1109/robot.1991.131734
Abstract
A distributed job shop scheduling algorithm has been implemented in the LAN (local area network) environment. The algorithm is a good candidate for distributed implementation since much of the computation time required for a solution is expended in distributable portions of the algorithm. A distributed processing support system (DPSS) was developed to ease the implementation of this and future distributed algorithms. Preliminary results indicate considerable potential for reducing the computation time. Additional portions of the algorithm may be distributed to improve the results, and streamlining of the underlying communication mechanism of DPSS is underway.Keywords
This publication has 5 references indexed in Scilit:
- Schedule generation and reconfiguration for parallel machinesIEEE Transactions on Robotics and Automation, 1990
- OR Forum—Perspectives on Parallel ComputingOperations Research, 1989
- Module replication and assignment for real-time distributed processing systemsProceedings of the IEEE, 1987
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977