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
标签: 添加标签
没有标签, 成为第一个标记此记录!

相似书籍