원문정보
초록
영어
In cloud manufacturing environment, for a scheduling Job, there may be a lot of servicizing manufacturing resources and manufacturing capability that can be used to support for its realizing. Therefore, how to efficiently solve FJSS problem becomes more complex and significant. First, this paper uses disjunctive graph model to analyze the characteristic of FJSS problems, and then, focusing on machine selection sub problem, this paper designs multi-rules to solve machine selection conflicts in different scenarios. Finally, on this basis, an improved multi-rules-based ACO algorithm is proposed. The algorithm is applied to the typical examples of the flexible job-shop scheduling problem. Compared with other algorithms, final experimental results indicate that this algorithm is effective.
목차
1. Introduction
2. Problem Description
2.1. Mathematical Model
2.2. Disjunctive Graph Model
3. Improved ACO Algorithm
3.1. Heuristic Rules for Solving Conflicts in Machine Selection
3.2. Machining Procedure Scheduling
3.3. The Pseudo Code and Flow Chart of Algorithm
4. Experimental Result
5. Conclusion
Acknowledgements
References