IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i9p3212-3229.html
   My bibliography  Save this article

A constraint programming approach to a real-world workforce scheduling problem for multi-manned assembly lines with sequence-dependent setup times

Author

Listed:
  • Funda Güner
  • Abdül K. Görür
  • Benhür Satır
  • Levent Kandiller
  • John. H. Drake

Abstract

For over five decades, researchers have presented various assembly line problems. Recently, assembly lines with multiple workers at each workstation have become very common in the literature. These lines are often found in the manufacturing of large vehicles, where workers at a workstation may perform their assigned tasks at the same time. Most research on multi-manned assembly lines focuses on balancing tasks and workers among workstations and scheduling tasks for workers. This study, however, concentrates on assigning tasks to workers already assigned to a specific workstation, rather than balancing the entire line. The problem was identified through an industrial case study at a large vehicle manufacturing company. The study presents two methods, one using mixed integer linear programming and the other using constraint programming, to minimise the number of workers required on a multi-manned assembly line with sequence-dependent setup times. The results of the computational experiments indicate that the constraint programming method performs better than the mixed integer linear programming method on several modified benchmark instances from the literature. The constraint programming model is also tested on the real-world scenario of our industrial case study and leads to significant improvements in the productivity of the workstations.

Suggested Citation

  • Funda Güner & Abdül K. Görür & Benhür Satır & Levent Kandiller & John. H. Drake, 2024. "A constraint programming approach to a real-world workforce scheduling problem for multi-manned assembly lines with sequence-dependent setup times," International Journal of Production Research, Taylor & Francis Journals, vol. 62(9), pages 3212-3229, May.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:9:p:3212-3229
    DOI: 10.1080/00207543.2023.2226772
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2226772
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2023.2226772?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:tprsxx:v:62:y:2024:i:9:p:3212-3229. 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/TPRS20 .

    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.