By Topic

PSO algorithm for a single machine scheduling problem with batching in chemical industries

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)
Ping Yan ; Liaoning Key Lab. of Manuf. Syst. & Logistics, Northeastern Univ., Shenyang, China ; Lixin Tang

In this paper, a single machine batch process scheduling problem (SBPSP) integrating batching decision is investigated. The integration problem of batching and scheduling is to allocate the demands from different customer orders to sets of batches and schedule these batches such that the total weighted tardiness costs and the total set-up costs are minimized. This problem is formulated as a mixed-integer nonlinear programming model and thus provides a challenging area for metaheuristics. We propose a hybrid algorithm of particle swarm optimization (PSO) and artificial immune algorithm (AIA) to solve this problem. In the proposed algorithm, a novel particle solution representation is designed for representing a batching scheme for SBPSP and the AIA mechanism improves the diversity of the swarm. Computational experiments on randomly generated instances with different structures show the validity and effectiveness of the proposed algorithm.

Published in:

Automation and Logistics, 2009. ICAL '09. IEEE International Conference on

Date of Conference:

5-7 Aug. 2009