Minimizing the number of workers in a paced mixed-model assembly line

Xavier Delorme 1, 2 Alexandre Dolgui 3, 4 Sergey Kovalev 5 Mikhail Kovalyov 6
1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
2 Mines Saint-Étienne MSE - École des Mines de Saint-Étienne
3 IMT Atlantique - DAPI - Département Automatique, Productique et Informatique
4 SLP - Systèmes Logistiques et de Production
LS2N - Laboratoire des Sciences du Numérique de Nantes
5 INSEEC Business School - Institut des hautes études économiques et commerciales Business School (INSEEC)
6 NASB - National Academy of Sciences of Belarus
Abstract : We study a problem of minimizing the maximum number of identical workers over all cycles of a paced assembly line comprised of m stations and executing n parts of k types. There are lower and upper bounds on the workforce requirements and the cycle time constraints. We show that this problem is equivalent to the same problem without the cycle time constraints and with fixed workforce requirements. We prove that the problem is NP-hard in the strong sense if and the workforce requirements are station independent, and present an Integer Linear Programming model, an enumeration algorithm and a dynamic programming algorithm. Polynomial in k and polynomial in n algorithms for special cases with two part types or two stations are also given. Relations to the Bottleneck Traveling Salesman Problem and its generalizations are discussed.
Keywords : computational complexity workforce assignment production line algorithms
Document type :
Journal articles
Complete list of metadatas

Cited literature [48 references]  Display  Hide  Download
https://hal-emse.ccsd.cnrs.fr/emse-01840007
Contributor : Florent Breuil <>
Submitted on : Monday, July 16, 2018 - 1:52:43 PM
Last modification on : Tuesday, January 21, 2020 - 1:26:15 AM
Long-term archiving on: Wednesday, October 17, 2018 - 2:37:18 PM

File

WorkersTSP 9 March.pdf
Files produced by the author(s)

Identifiers

Collections

EMSE | CNRS | IMT-ATLANTIQUE | LS2N | UNAM | INSTITUT-TELECOM | LIMOS | EC-NANTES | DEMO-ENSMSE | FAYOL-ENSMSE | UNIV-NANTES | PRES_CLERMONT | LS2N-SLP

Citation

Xavier Delorme, Alexandre Dolgui, Sergey Kovalev, Mikhail Kovalyov. Minimizing the number of workers in a paced mixed-model assembly line. European Journal of Operational Research, Elsevier, 2019, 272 (1), pp.188 - 194. ⟨10.1016/j.ejor.2018.05.072⟩. ⟨emse-01840007⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

257

Files downloads

347

Contact

Informations

CCSD