摘要
The paper considers the problem of scheduling n jobs in a two-machine flow-shop to minimize the weighted sum of completion times. Between the completion of an operation and the beginning of the next operation of the same job, there is a time lag, which wherever to it as the transportation delays. All transportation delays have to be done by a single robot, which can perform at most one transportation at a time. And release dates rj may be given for the jobs. New complexity results are derived for special case. For a new heuristic algorithm, the worst-case performance is 3/2, and the bound is tight.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 381-391 |
| 页数 | 11 |
| 期刊 | Applied Mathematical Sciences |
| 卷 | 4 |
| 期 | 5-8 |
| 出版状态 | 已出版 - 1月 2010 |
关键词
- Complexity
- Flow-shop scheduling problem
- Release times
- Single robot
- Transportation delays
收录
- Scopus
学术指纹
探究 'Complexity of minimize total weighted average completion time scheduling problems with release times' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver