원문정보
초록
영어
Traditional flexible flow shop scheduling cannot adapt to the work processes with existence of parallel machines, and blocks or limits the processes with no-wait constraints. Firstly, according to the problem in NWBFFSSP, which minimizes the maximum time used in the flow shop, an optimal solving model has been designed to realize the flexible flow shop scheduling with multi constraints; besides, for the distribution of machinery is improved, Finally, in the solving process, a real-time release priority strategy has been proposed to determine processing machine for each work piece. Furthermore, a methodology to detect work piece conflicts has been introduced while the conflicts are then eliminated by a kind of right moving strategy based on the maximum difference. The experimental results verify the effectiveness and feasibility of the proposed algorithm.
목차
1. Introduction
2. Problem Model
3. Proposed Algorithm
A Initial conditions
B FRF Strategy and FCF Strategy
C The Adjust Strategy of NWFFSSP
D Conflict Detection and Removing
E Advance – Iterative Algorithm
F Particle Code
G Particle Updating Method
H Flow Chart of the Algorithm
4. Experimental Results
A Experiment on Feasibility Analysis
B Experiment on Efficiency Analysis
5. Conclusion
ACKNOWLEDGEMENTS
References