Online scheduling in Minimizing Makespan on Identical Parallel Processor with Release Date
In 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...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Universiti Teknologi Malaysia * Fakulti Sains
2014
|
| Subjects: | |
| Online Access: | http://www.matematika.utm.my/index.php/matematika/article/view/740/666 http://hdl.handle.net/20.500.11937/20607 |