151
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

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

&
Pages 1420-1422 | Received 31 Aug 2020, Accepted 19 Feb 2021, Published online: 10 Mar 2021
 

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.

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

Our research has been supported by CNPq (grant 420348/2016-6), Coordenação de Aperfeiçoamento de Pessoal de Nível Superior – Brasil (CAPES) – Finance Code 001 and by the Chilean Council of Scientific and Technological Research (CONICYT) through Fondecyt (grant 1191624 “Assembly line balancing for industry 4.0”).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.