By Topic

A simulated annealing algorithm based on bottleneck jobs for the open shop scheduling problem

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
$33 $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)
Rui Zhang ; Department of Automation, Tsinghua University, Beijing 100084, China ; Cheng Wu

A simulated annealing algorithm based on bottleneck jobs is presented for the open shop scheduling problem in which the total weighted tardiness must be minimized. Bottleneck jobs have significant impact on the final scheduling performance and therefore need to be considered with higher priority. In order to describe the characteristic information concerning bottleneck jobs, a fuzzy inference system is employed to transform human knowledge into the bottleneck characteristic values which are then used to design an immune operator. Finally, a simulated annealing algorithm combined with the immune mechanism is devised to solve the open shop scheduling problem. In the algorithm, the bottleneck characteristic value for each job in the current solution is evaluated and the vaccination procedure is applied for generating a new solution. Numerical computations for problems of different scales show that the proposed algorithm achieves effective results by accelerating the convergence of the optimization process.

Published in:

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Date of Conference:

25-27 June 2008