By Topic

A hybrid evolutionary search scheduling algorithm to solve the job 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

3 Author(s)
P. Van Bael ; Chem. Eng. Dept., Katholieke Univ., Leuven, Heverlee, Belgium ; D. Devogelaere ; M. Rijckaert

This paper describes an evolutionary search scheduling algorithm (ESSA) developed to solve the most difficult job shop scheduling problems (JSSP) that are known to be NP-hard combinatorial optimization problems. The ESSA proposed is a hybrid approach that focuses on optimization of locally optimized solutions. The differences versus other ESSA strategies are the new proposed encoding, decoding and forcing scheme, the local search optimizer that uses a new repair based neighborhood structure and a new bootstrapping strategy. Experimental results on common benchmarks indicate the power of the hybrid ESSA. The results clearly show that optimal schedules can be found. Moreover, the algorithm outperformed several ESSAs on average results with moderate computation time needed

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:2 )

Date of Conference:

1999