Name
Abstract | ||
|---|---|---|
•A paced line is designed to assemble different types of products in large series.•Workers can move among stations to adapt workstation capacities to workloads.•The problem is to minimize the total number of workers employed at the line.•Computational complexity for various special cases of the problem is established.•Heuristics and integer linear programs are developed, numerical tests are reported. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ejor.2017.06.017 | European Journal of Operational Research |
Keywords | Field | DocType |
Workforce assignment,Scheduling,Complexity analysis,Mixed integer linear programming,Heuristics | Computer experiment,Mathematical optimization,Schedule (project management),Multiprocessor scheduling,Workforce,Scheduling (computing),Computer science,Combinatorial optimization,Heuristics,Operations management,Computational complexity theory | Journal |
Volume | Issue | ISSN |
264 | 1 | 0377-2217 |
Citations | PageRank | References |
5 | 0.45 | 21 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandre Dolgui | 1 | 847 | 95.46 |
| Sergey Kovalev | 2 | 30 | 4.81 |
| Mikhail Y. Kovalyov | 3 | 1602 | 118.18 |
| Sergey Malyutin | 4 | 5 | 0.45 |
| Ameur Soukhal | 5 | 119 | 10.15 |