Multi-Objective Optimization Algorithm for Job Shop Scheduling Problem in Discrete Manufacturing Enterprise

Article Preview

Abstract:

Job Shop scheduling should satisfy the constraints of time, order and resource. To solve this NP-Hard problem, multi-optimization for job shop scheduling problem (JSSP) in discrete manufacturing plant is researched. Objective of JSSP in discrete manufacturing enterprise was analyzed, and production scheduling optimization model was constructed with the optimization goal of minimizing the bottleneck machines’ make-span and the total products’ tardiness; Then, Particle Swarm Optimization (PSO) algorithm was used to solve this model by the process-based encoding mode; To solve the premature convergence problem of PSO, advantages of Simulated Annealing (SA) algorithm, such as better global optimization performance, was integrated into PSO algorithm and a Hybrid PSO-SA Algorithm (HPSA) was proposed and the flowchart was presented; Then, this hybrid algorithm was applied in actual production scheduling of a discrete manufacturing enterprise. Finally, comparative analysis of HPSA/SA/PSO optimal methods and actual scheduling plan was carried out, which verify the result that the HPSA is effective and superiority.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

860-864

Citation:

Online since:

March 2015

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] L.L. Zhang. Research on algorithm and application for production planning and scheduling [D]. Beijing: North China Electric Power University, 2004, in Chinese.

Google Scholar

[2] FU Zhen-ao. The research of Job Shop Scheduling Problem based on Particle Swarm Optimization algorithm [D]. Hefei: Hefei University of Technology, 2009, in Chinese.

Google Scholar

[3] L. Tao G.P. Zhao: Business Research. 4 (2012): 142-145.

Google Scholar

[4] LIN Lingjuan. Research and application of the simulated annealing particle swarm mixing algorithm [D]. Ji Nan: Shan Dong Normal University, 2010, in Chinese.

Google Scholar

[5] J.L. Liu, D.M. Zhu: Journal of Shandong Radio and TV University. 2 (2012): 70-72.

Google Scholar

[6] Y. Liu, Z. Qin, Z.W. Shi. Hybrid particle swarm optimizer with line search. Proceedings of 2004 IEEE International Conference on Systems Man and Cybernetics. 2004, 3751-3755.

DOI: 10.1109/icsmc.2004.1400928

Google Scholar