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

Genetic algorithm and decision support for assembly line balancing in the automotive industry

Author

Listed:
  • J. B. H. C. Didden
  • E. Lefeber
  • I. J. B. F. Adan
  • I. W. F. Panhuijzen

Abstract

An important and highly complex process in the automotive industry is the balancing of the assembly lines. Optimally distributing jobs among the lines in order to obtain the highest efficiency is mostly done manually, taking a lot of time. This paper aims to automate the process of line balancing for a real-world test case. Automotive assembly lines are highly complex, and multiple factors have to be considered while balancing the lines. All factors relevant in a case study at VDL Nedcar are considered, namely, mixed-model production, sequence-dependent setup times, variable workplaces with multiple operators and multiple assignment constraints. A Genetic Algorithm (GA) is proposed to solve the formulated balancing problem and to act as a decision support system. Results on newly proposed benchmark instances show that the solution is dependent on the relation between the takt time and processing time of jobs, as well as the setup times. In addition, results of a real-life case study show that the proposed GA is effective in balancing a real-world assembly line and that it can both increase the efficiency of the line and decrease the variance in operating time between all model variants when compared to current practice.

Suggested Citation

  • J. B. H. C. Didden & E. Lefeber & I. J. B. F. Adan & I. W. F. Panhuijzen, 2023. "Genetic algorithm and decision support for assembly line balancing in the automotive industry," International Journal of Production Research, Taylor & Francis Journals, vol. 61(10), pages 3377-3395, May.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:10:p:3377-3395
    DOI: 10.1080/00207543.2022.2081630
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2022.2081630?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:61:y:2023:i:10:p:3377-3395. 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.