| An analysis of LS algorithm for the problem of scheduling multiple jobs on multiple uniform processors with ready time (PJO) |
 |
|
Volume 7
|
|
Number 3
|
|
pp.551-564
|
|
|
| An analysis of LS algorithm for the problem of scheduling multiple jobs on multiple uniform processors with ready time |
| Wei Ding and Yi Zhao |
|
 |
|
| Key words |
Mathematices Subject Classification |
| heuristic algorithm, LS algorithm, LPT algorithm, processors, tight bound |
90B35, 68M20 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Copyright© 2011 Yokohama Publishers |
|
For Editor |
|
For Authors |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|