Optimal workforce assignment to operations of a paced assembly line

Abstract : We study a paced assembly line intended for manufacturing different products. Workers with identical skills perform non-preemptable operations whose assignment to stations is known. Operations assigned to the same station are executed sequentially, and they should follow the given precedence relations. Operations assigned to different stations can be performed in parallel. The operation's processing time depends on the number of workers performing this operation. The problem consists in assigning workers to operations such that the maximal number of workers employed simultaneously in the assembly line is minimized, the line cycle time is not exceeded and the box constraints specifying the possible number of workers for each operation are not violated. We show that the general problem is NP-hard in the strong sense, develop conventional and randomized heuristics, propose a reduction to a series of feasibility problems, present a MILP model for the feasibility problem, show relation of the feasibility problem to multi-mode project scheduling and multiprocessor scheduling, establish computational complexity of several special cases based on this relation and provide computer experiments with real and simulated data.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 2018, 264 (1), pp.200-211. 〈10.1016/j.ejor.2017.06.017〉
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-01688688
Contributeur : Alexandre Dolgui <>
Soumis le : vendredi 19 janvier 2018 - 16:01:43
Dernière modification le : mardi 9 octobre 2018 - 11:46:07
Document(s) archivé(s) le : jeudi 24 mai 2018 - 08:29:40

Fichier

Workers 17 April 2017.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Alexandre Dolgui, Sergey Kovalev, Mikhail Kovalyov, Sergey Malyutin, Ameur Soukhal. Optimal workforce assignment to operations of a paced assembly line. European Journal of Operational Research, Elsevier, 2018, 264 (1), pp.200-211. 〈10.1016/j.ejor.2017.06.017〉. 〈hal-01688688〉

Partager

Métriques

Consultations de la notice

273

Téléchargements de fichiers

100