toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
  Record Links
Author (up) Pereira, J.; Ritt, M doi  openurl
  Title A note on “Algorithms for the Calzedonia workload allocation problem” Type
  Year 2022 Publication Journal of the Operational Research Society Abbreviated Journal J. Oper. Res. Soc.  
  Volume 73 Issue 6 Pages 1420-1422  
  Keywords Assembly line balancing; worker allocation; dynamic programming  
  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.  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0160-5682 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000627308200001 Approved  
  Call Number UAI @ alexi.delcanto @ Serial 1351  
Permanent link to this record
Select All    Deselect All
 |   | 

Save Citations:
Export Records: