IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v50y2025i4d10.1007_s10878-025-01347-7.html
   My bibliography  Save this article

A quantum genetic algorithm for a parallel machine scheduling problem

Author

Listed:
  • Tilmann Schwenzow

    (Siemens AG
    Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU))

  • Annika Lehnert

    (Karlsruher Institut für Technologie (KIT))

  • Christoph Liebrecht

    (Siemens AG)

  • Jörg Franke

    (Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU))

  • Sebastian Reitelshöfer

    (Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU))

Abstract

Scheduling problems are a common challenge across various industries. This paper addresses a specific problem arising in printed circuit board (PCB) assembly: the parallel machines scheduling problem with sequence-dependent setup times. To address this challenge, we propose a hybrid quantum genetic algorithm (QGA) designed to solve this problem on an error-free quantum computer. The development focuses on three key aspects: efficient adaptability of the quantum circuit to different problem instances, feasibility of the measured circuit outputs, and efficient utilization of qubits. To compare the quantum algorithm with its purely classical counterpart, we introduce a novel key performance indicator to quantify a potential quantum speedup. Furthermore, we evaluate the convergence behavior of the solver across various problem instances. Our results demonstrate that the QGA exhibits strong convergence behavior, resulting in near-optimal solutions. Additionally, we identify a potential quantum advantage for solving this practical problem. The advantage increases as the population size grows.

Suggested Citation

  • Tilmann Schwenzow & Annika Lehnert & Christoph Liebrecht & Jörg Franke & Sebastian Reitelshöfer, 2025. "A quantum genetic algorithm for a parallel machine scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 50(4), pages 1-22, November.
    • Handle: RePEc:spr:jcomop:v:50:y:2025:i:4:d:10.1007_s10878-025-01347-7
    DOI: 10.1007/s10878-025-01347-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01347-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01347-7?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:jcomop:v:50:y:2025:i:4:d:10.1007_s10878-025-01347-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.