Name
Abstract | ||
|---|---|---|
•An industrial workforce assignment problem is studied.•The problem is proved strongly NP-hard for a special case.•Solution approaches for the general problem are suggested.•Polynomial and pseudo-polynomial algorithms for special cases are developed.•Relations to the Bottleneck Traveling Salesman Problem are discussed. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejor.2018.05.072 | European Journal of Operational Research |
Keywords | Field | DocType |
Combinatorial optimization,Workforce assignment,Production line,Computational complexity,Algorithms | Bottleneck traveling salesman problem,Dynamic programming,Mathematical optimization,Polynomial,Generalization,Combinatorial optimization,Mixed model,Production line,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
272 | 1 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xavier Delorme | 1 | 126 | 14.93 |
| Alexandre Dolgui | 2 | 847 | 95.46 |
| Sergey Kovalev | 3 | 30 | 4.81 |
| Mikhail Y. Kovalyov | 4 | 1602 | 118.18 |