Assembly line balancing: general resource-constrained case - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Production Research Année : 2010

Assembly line balancing: general resource-constrained case

Résumé

The problem of designing and balancing assembly lines has been widely studied in the literature. A recently introduced issue is the efficient use of constrained resources with specific assumptions, in which a task needs a resource type (A) or one of two resources (A ν B). This paper presents a more general resource-constrained case, in which each task needs resources that may be simple or multiple, alternative and/or concurrent: for instance, (3A), (A Λ 4B Λ 3C), (3A ν 2B ν C), (A Λ B) ν (2C Λ D) or (A ν B) Λ (2C ν D). We also introduce an upper bound on the number of available resources. Finally, we present a computational experiment using the mathematical models that we develop, showing the instances that can be efficiently solved.

Mots clés

Fichier principal
Vignette du fichier
PEER_stage2_10.1080%2F00207543.2010.481294.pdf (300.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00602982 , version 1 (24-06-2011)

Identifiants

Citer

Albert Corominas, Laia Ferrer, Rafael Pastor. Assembly line balancing: general resource-constrained case. International Journal of Production Research, 2010, pp.1. ⟨10.1080/00207543.2010.481294⟩. ⟨hal-00602982⟩

Collections

PEER
105 Consultations
198 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More