Assembly line balancing: general resource-constrained case

Abstract

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.

Keywords:

• assembly line balancing
• resource constraint

Acknowledgements

This paper was supported by the Spanish MCyT project DPI2007-61905 and co-financed by FEDER.