Online scheduling in minimizing makespan on identical parallel processor with release date

n this paper, we address a non-preemptive task scheduling problem with an objective function of minimizing the makespan. We consider online scheduling with release date on identical parallel processing system with centralized and no splitting structure. Multi-steps heuristic algorithms are proposed...

全面介紹

Saved in:
書目詳細資料
Main Authors: Nordin, Syarifah Zyurina, Lou, Caccetta
格式: Article
語言:English
出版: Department of Mathematical Sciences, UTM 2014
主題:
在線閱讀:http://eprints.utm.my/id/eprint/59857/1/SyarifahZyurina2014_OnlineSchedulinginMinimizingMakespan.pdf
http://eprints.utm.my/id/eprint/59857/
https://matematika.utm.my/index.php/matematika/article/view/740/666
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!

相似書籍