DocumentCode :
3525858
Title :
Simulated annealing approach for the single-machine total late work scheduling problem with a position-based learning
Author :
Wu, Chin-Chia ; Chen, Hung-Ming ; Cheng, Shuenn-Ren ; Hsu, Chou-Jung ; Wu, Wen-Hung
Author_Institution :
Dept. of Stat., Feng Chia Univ., Taichung, Taiwan
Volume :
Part 2
fYear :
2011
fDate :
3-5 Sept. 2011
Firstpage :
839
Lastpage :
843
Abstract :
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.
Keywords :
simulated annealing; single machine scheduling; NP-hard; position-based learning effect; simulated annealing; single-machine scheduling problem; total late work scheduling problem; Computers; Europe; Job shop scheduling; Operations research; Processor scheduling; Simulated annealing; Single machine scheduling; learning effect; scheduling; simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Engineering and Engineering Management (IE&EM), 2011 IEEE 18Th International Conference on
Conference_Location :
Changchun
Print_ISBN :
978-1-61284-446-6
Type :
conf
DOI :
10.1109/ICIEEM.2011.6035289
Filename :
6035289
Link To Document :
بازگشت