A note on “Algorithms for the Calzedonia workload allocation problem”

Jordi Pereira, Marcus Ritt

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

1 Cita (Scopus)

Resumen

Battarra et al. recently proposed a novel assembly line balancing problem with applications to the apparel industry, where the tasks are performed in a fixed order. To solve the problem, one has to assign workers and tasks to the workstations with the objective of maximising the throughput of the assembly line. In this paper, we provide dynamic programming formulations for the general problem and some special cases. We then use these formulations to develop an exact solution approach that optimally solves the instances in Battarra et al. within seconds.

Idioma originalInglés
Páginas (desde-hasta)1420-1422
Número de páginas3
PublicaciónJournal of the Operational Research Society
Volumen73
N.º6
DOI
EstadoPublicada - 2022
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'A note on “Algorithms for the Calzedonia workload allocation problem”'. En conjunto forman una huella única.

Citar esto