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

Feng Shan Pan; Chun Ming Ye; Jiao Yang

doi:10.4028/www.scientific.net/AMR.605-607.487

Paper Titles

Pilot Investigation on the Driving Posture Comfort among Malaysian Drivers
p.466

Product Style Map — An Effective Tool for Product Strategy Planning
p.472

Research on Exhibition Logistics Information System Designing
p.479

The Intelligent Forecasting Method of Mine Equipment Maintenance Plan
p.483

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

Information on Risks and Prevention of the Supply Chain in E-Commerce Environment
p.493

The Architecture for Solving the Cross-Domain Keywords During New Product Development
p.497

Spare Parts Production Planning Model Based on Fuzzy Programming
p.501

Value Chain Theory and its Application in Steel Enterprises
p.507

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 605-607Flexible Job-Shop Scheduling Problem under...

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 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.

You might also be interested in these eBooks

Advanced Designs and Researches for Manufacturing

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 605-607)

Pages:

487-492

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.605-607.487

Citation:

Cite this paper

Online since:

December 2012

Authors:

Feng Shan Pan, Chun Ming Ye, Jiao Yang

Keywords:

Flexible Job-Shop Scheduling Problem, Optimization, Quantum Particle Swarm Optimization

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Sun J,Feng B,Xu WB. Particle swarm optimization with particles having quantum behavior[C].Proceedings of Congress on Evolutionary Computation. Piscataway: IEEE Press,2004:325-331.

DOI: 10.1109/cec.2004.1330875

Google Scholar

[2] Zhen-ao Fu, Xin-bao Liu, Hao Cheng, Mi Zhou. Hybrid QPSO algorithm for job shop scheduling problems[J]. Journal of Hefei University of Technology (Natural Science),2009,32(3):369-373.

Google Scholar

[3] Feng Bian, Li Mao. An improved QPSO for solving TSP [J].Computer Applications and Software,2009,31(2):75-78.

Google Scholar

[4] Zhifeng Yin, Jianjun Chen. Hybrid Quantum Evolutionary Algorithms and Its Application in Multiuser Detection[J]. Journal of Henan Normal University (Natural Science),2006,34(4):46-49.

Google Scholar

[5] Ji Zhao, Jun Sun, Wenbo Xu. Multi-peaks function optimization using quantum-behaved particle swarm optimization[J]. Journal of Computer Applications,2006,26(12):2956-2960.

DOI: 10.1109/wcica.2006.1712998

Google Scholar

[6] Xiaoyu Song, Yunlong Zhu, Chaowan Yin. Hybrid ant colony algorithm for fuzzy Job Shop scheduling [J]. Computer Integrated Manufacturing Systems,2007,13(1):105-109,125.

DOI: 10.1109/wcica.2006.1714516

Google Scholar