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...

詳細記述

保存先:
書誌詳細
主要な著者: Nordin, Syarifah Zyurina, Lou, Caccetta
フォーマット: 論文
言語: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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料