IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i6p1420-1422.html
   My bibliography  Save this article

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

Author

Listed:
  • Jordi Pereira
  • Marcus Ritt

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.

Suggested Citation

  • Jordi Pereira & Marcus Ritt, 2022. "A note on “Algorithms for the Calzedonia workload allocation problem”," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(6), pages 1420-1422, June.
    • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:6:p:1420-1422
    DOI: 10.1080/01605682.2021.1895685
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1895685
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2021.1895685?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:73:y:2022:i:6:p:1420-1422. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.