摘要
This paper considers a problem of uniform-machine scheduling with machine release times to minimize makespan. Firstly, four properties of swapping jobs are proposed. Then, based on the properties, a heuristic algorithm is presented, which takes the LPT schedule as its initial solution and improves the solution by repeatedly swapping the jobs between two machines with the maximal and minimal makespan. Finally, computational results show that the presented heuristic is efficient and effective.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 2022-2030 |
| 页数 | 9 |
| 期刊 | Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice |
| 卷 | 32 |
| 期 | 9 |
| 出版状态 | 已出版 - 9月 2012 |
| 已对外发布 | 是 |
学术指纹
探究 'Heuristic algorithm for uniform-machine scheduling with machine release times' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver