Title
A heuristic-based hybrid solution for parallel machine scheduling problems with earliness and tardiness penalties
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.
Year
DOI
Venue
2003
10.1109/ETFA.2003.1248706
Emerging Technologies and Factory Automation, 2003. Proceedings. ETFA '03. IEEE Conference
Keywords
Field
DocType
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
Mathematical optimization,Tardiness,Fair-share scheduling,Computer science,Flow shop scheduling,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling
Conference
Volume
ISBN
Citations 
2
0-7803-7937-3
1
PageRank 
References 
Authors
0.36
1
3
Name
Order
Citations
PageRank
Hisashi Tamaki114140.54
Hajime Murao2216.70
Kitamura, S.382.82