DocumentCode
399253
Title
A heuristic-based hybrid solution for parallel machine scheduling problems with earliness and tardiness penalties
Author
Tamaki, Hisashi ; Murao, Hajime ; Kitamura, Shinzo
Author_Institution
Dept. of Comput. & Syst. Engr., Kobe Univ., Japan
Volume
2
fYear
2003
fDate
16-19 Sept. 2003
Firstpage
239
Abstract
An identical parallel machine scheduling problem with earliness and tardiness penalties is studied. First, a hybrid method adopting the meta-heuristics, e.g., the simulated annealing method combined with list scheduling techniques is proposed, where the heuristic procedure MPA (minimum penalty increase assignment) and the SD (start-time decision) are newly introduced. Then, through several computational experiments, the effectiveness and the potential of the proposed method are investigated.
Keywords
operations research; production control; simulated annealing; earliness penalty; list scheduling techniques; minimum penalty increase assignment; parallel machine scheduling problem; simulated annealing method; start-time decision; tardiness penalty; Computational modeling; Mathematical programming; Parallel machines; Processor scheduling; Simulated annealing; Single machine scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Emerging Technologies and Factory Automation, 2003. Proceedings. ETFA '03. IEEE Conference
Print_ISBN
0-7803-7937-3
Type
conf
DOI
10.1109/ETFA.2003.1248706
Filename
1248706
Link To Document