By Topic

An Improved Particle Swarm Optimization Algorithm for the Hybrid Flowshop Scheduling to Minimize Total Weighted Completion Time in Process Industry

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lixin Tang ; Liaoning Key Lab. of Manuf. Syst. & Logistics, Northeastern Univ., Shenyang, China ; Xianpeng Wang

In this paper, we present an improved particle swarm optimization (PSO) algorithm for the hybrid flowshop scheduling (HFS) problem to minimize total weighted completion time. This problem has a strong practical background in process industry. For example, the integrated production process of steelmaking, continuous-casting, and hot rolling in the iron and steel industry, and the short-term scheduling problem of multistage multiproduct batch plants in the chemical industry can be reduced to a HFS problem. To make PSO applicable in the HFS problem, we use a job permutation that is the processing order of jobs in the first stage to represent a solution, and construct a greedy method to transform this job permutation into a complete HFS schedule. In addition, a hybrid variable neighborhood search (VNS) incorporating variable depth search, a hybrid simulated annealing incorporating stochastic local search, and a three-level population update method are incorporated to improve the search intensification and diversification of the proposed PSO algorithm. Computational experiments on practical production data and randomly generated instances show that the proposed PSO algorithm can obtain good solutions compared to the lower bounds and other metaheuristics.

Published in:

Control Systems Technology, IEEE Transactions on  (Volume:18 ,  Issue: 6 )