2012
DOI: 10.4028/www.scientific.net/amr.605-607.487
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 5 publications
0
0
0
Order By: Relevance