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

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.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 2018, 〈10.1016/j.ejor.2018.05.072〉
Liste complète des métadonnées

Littérature citée [48 références]  Voir  Masquer  Télécharger

https://hal-emse.ccsd.cnrs.fr/emse-01840007
Contributeur : Florent Breuil <>
Soumis le : lundi 16 juillet 2018 - 13:52:43
Dernière modification le : mercredi 12 décembre 2018 - 10:48:01
Document(s) archivé(s) le : mercredi 17 octobre 2018 - 14:37:18

Fichier

WorkersTSP 9 March.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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, 2018, 〈10.1016/j.ejor.2018.05.072〉. 〈emse-01840007〉

Partager

Métriques

Consultations de la notice

129

Téléchargements de fichiers

49