By Topic

Dominance property based tabu search for single machine scheduling problems with family setups

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 $33
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)
Jin Feng ; Dept. of Automation, Tsinghua Univ., Beijing 100084, P. R. China ; Song Shiji ; Wu Cheng

The problem of minimizing the maximum lateness on a single machine with family setups is considered. To solve the problem, dominance property is studied and then introduced into the tabu search (TS) algorithm. With the dominance property, most unpromising neighbors can be excluded from the neighborhood, which makes the search process always focus on the most promising areas of the solution space. The proposed algorithms are tested both on the randomly generated problems and on the real-life problems. Computational results show that the proposed TS algorithm outperforms the best existing algorithm and can solve the real-life problems in about 1.3 on average.

Published in:

Journal of Systems Engineering and Electronics  (Volume:20 ,  Issue: 6 )