By Topic

Swarm-based neighborhood search algorithm for job shop scheduling with batch processing machines

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

3 Author(s)
Qiongfang Zhang ; Sch. of Autom., Wuhan Univ. of Technol., Wuhan, China ; Deming Lei ; Nianyu Zhang

Job shop scheduling problem with batch processing machines frequently exists in the real lift production process; however, the problem is seldom investigated. This paper proposes a scheduling algorithm based on swarm-based neighborhood search to solve the problem. A batch based representation is used after batches are formed by using lots of the same product and a decoding procedure with batching decision is proposed. Then a swap operator is applied to some individuals and an insertion is done on other individuals. The worst solution of the swarm is replaced with the elite solution every iterations. The computational experiment verifies the feasibility and efficiency of the algorithm.

Published in:

Control Conference (CCC), 2012 31st Chinese

Date of Conference:

25-27 July 2012