By Topic

Simulated annealing approach for the single-machine total late work scheduling problem with a position-based learning

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

5 Author(s)
Chin-Chia Wu ; Dept. of Stat., Feng Chia Univ., Taichung, Taiwan ; Hung-Ming Chen ; Shuenn-Ren Cheng ; Chou-Jung Hsu
more authors

This paper considers a single-machine scheduling problem with a position-based learning effect where the aim is to find an optimal sequence to minimize the total late work. The late work for a job means the amount of processing of this job that is performed after its due date. Because the problem under consideration is NP-hard, this paper then proposes several simulated annealing algorithms for the near-optimal solution. Finally, the computational results of proposed algorithms are also reported.

Published in:

Industrial Engineering and Engineering Management (IE&EM), 2011 IEEE 18Th International Conference on  (Volume:Part 2 )

Date of Conference:

3-5 Sept. 2011