Flexible Job-Shop Scheduling Problem under Uncertainty Based on QPSO Algorithm

Flexible Job-shop Scheduling Problem is the extending of the classical Job-shop Scheduling Problem, which has more practical significance than JSP. This paper firstly presents a solution for FJSP under uncertainty based on QPSO algorithm, mainly on uncertain operation time and uncertain delivery time, and then describes the mathematical model and solving process. Subsequent sections concentrate on the designed and conducted experiment simulation using instances, and analyze the experimental results on the QPSO performance compared with some results of other traditional algorithms from literature review. Finally, this paper illustrates QPSO has better performance and shows the promising for dealing with FJSP.