Name
Title | ||
|---|---|---|
The m-machine flowshop problem with unit-time operations and intree precedence constraints |
Abstract | ||
|---|---|---|
We consider the flowshop problem with unit-time operations and intree precedence constraints, with the objective to minimize the total completion time. We present a polynomial-time algorithm assuming that the number of machines is fixed. This proves a recently stated conjecture. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.orl.2004.08.001 | Oper. Res. Lett. |
Keywords | Field | DocType |
polynomial algorithm,flowshop problem,unit-time operation,total completion time,scheduling,m-machine flowshop problem,flowshop,polynomial-time algorithm,intree precedence constraint | Mathematical optimization,Scheduling (computing),Flow shop scheduling,Polynomial algorithm,Time complexity,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 3 | Operations Research Letters |
Citations | PageRank | References |
1 | 0.78 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Averbakh | 1 | 699 | 54.76 |
| O. Berman | 2 | 1604 | 231.36 |
| Ilya Chernykh | 3 | 21 | 4.68 |