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

Jordi Pereira, Marcus Ritt

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)1420-1422
Number of pages3
JournalJournal of the Operational Research Society
Volume73
Issue number6
DOIs
StatePublished - 2022
Externally publishedYes

Keywords

  • Assembly line balancing
  • dynamic programming
  • worker allocation

Fingerprint

Dive into the research topics of 'A note on “Algorithms for the Calzedonia workload allocation problem”'. Together they form a unique fingerprint.

Cite this