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: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Department of Mathematical Sciences, UTM
2014
|
| Subjects: | |
| Online Access: | 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|