{"id":"https://openalex.org/W4415327331","doi":"https://doi.org/10.1007/s10878-025-01347-7","title":"A quantum genetic algorithm for a parallel machine scheduling problem","display_name":"A quantum genetic algorithm for a parallel machine scheduling problem","publication_year":2025,"publication_date":"2025-10-18","ids":{"openalex":"https://openalex.org/W4415327331","doi":"https://doi.org/10.1007/s10878-025-01347-7"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-025-01347-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01347-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01347-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01347-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107130243","display_name":"Tilmann Schwenzow","orcid":"https://orcid.org/0009-0001-4913-9834"},"institutions":[{"id":"https://openalex.org/I1325886976","display_name":"Siemens (Germany)","ror":"https://ror.org/059mq0909","country_code":"DE","type":"company","lineage":["https://openalex.org/I1325886976"]},{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tilmann Schwenzow","raw_affiliation_strings":["Institute for Factory Automation and Production Systems (FAPS), Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU), Egerlandstra\u00dfe 7, 91058, Erlangen, Germany","Manufacturing, Siemens AG, Oestliche Rheinbrueckenstr. 50, 76187, Munich, Germany"],"raw_orcid":"https://orcid.org/0009-0001-4913-9834","affiliations":[{"raw_affiliation_string":"Institute for Factory Automation and Production Systems (FAPS), Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU), Egerlandstra\u00dfe 7, 91058, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Manufacturing, Siemens AG, Oestliche Rheinbrueckenstr. 50, 76187, Munich, Germany","institution_ids":["https://openalex.org/I1325886976"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Annika Lehnert","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Annika Lehnert","raw_affiliation_strings":["Fakultaet f\u00fcr Mathematik, Karlsruher Institut f\u00fcr Technologie (KIT), Englerstra\u00dfe 2, 76131, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakultaet f\u00fcr Mathematik, Karlsruher Institut f\u00fcr Technologie (KIT), Englerstra\u00dfe 2, 76131, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008411107","display_name":"Christoph Liebrecht","orcid":null},"institutions":[{"id":"https://openalex.org/I1325886976","display_name":"Siemens (Germany)","ror":"https://ror.org/059mq0909","country_code":"DE","type":"company","lineage":["https://openalex.org/I1325886976"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Liebrecht","raw_affiliation_strings":["Manufacturing, Siemens AG, Oestliche Rheinbrueckenstr. 50, 76187, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Manufacturing, Siemens AG, Oestliche Rheinbrueckenstr. 50, 76187, Munich, Germany","institution_ids":["https://openalex.org/I1325886976"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059197069","display_name":"J\u00f6rg Franke","orcid":"https://orcid.org/0000-0003-0700-2028"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Franke","raw_affiliation_strings":["Institute for Factory Automation and Production Systems (FAPS), Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU), Egerlandstra\u00dfe 7, 91058, Erlangen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Factory Automation and Production Systems (FAPS), Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU), Egerlandstra\u00dfe 7, 91058, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035932628","display_name":"Sebastian Reitelsh\u00f6fer","orcid":"https://orcid.org/0000-0002-4472-0208"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Reitelsh\u00f6fer","raw_affiliation_strings":["Institute for Factory Automation and Production Systems (FAPS), Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU), Egerlandstra\u00dfe 7, 91058, Erlangen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Factory Automation and Production Systems (FAPS), Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU), Egerlandstra\u00dfe 7, 91058, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5107130243"],"corresponding_institution_ids":["https://openalex.org/I1325886976","https://openalex.org/I181369854"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.9829,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.82566521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"50","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5698000192642212},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5579000115394592},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.551800012588501},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.5206999778747559},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4691999852657318},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4453999996185303},{"id":"https://openalex.org/keywords/qubit","display_name":"Qubit","score":0.44359999895095825},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4422999918460846},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.4417000114917755}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6804999709129333},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5698000192642212},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5579000115394592},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.551800012588501},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5206999778747559},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4945000112056732},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4691999852657318},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4453999996185303},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.44359999895095825},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4422999918460846},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4417000114917755},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4390000104904175},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.41280001401901245},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4106000065803528},{"id":"https://openalex.org/C124148022","wikidata":"https://www.wikidata.org/wiki/Q2122210","display_name":"Quantum circuit","level":5,"score":0.4106000065803528},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.3799999952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36559998989105225},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3643999993801117},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3165999948978424},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.30410000681877136},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2962000072002411},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.29409998655319214},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2623000144958496},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.25619998574256897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2533000111579895},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-025-01347-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01347-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01347-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:open.fau.de:openfau/37787","is_oa":true,"landing_page_url":"https://open.fau.de/handle/openfau/37787","pdf_url":"https://open.fau.de/bitstreams/20ff3864-f1fc-4c11-9535-56637dcb11ec/download","source":{"id":"https://openalex.org/S7407055110","display_name":"OPUS FAU - Online publication system of Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-025-01347-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01347-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01347-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320873","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415327331.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W964861289","https://openalex.org/W1638815512","https://openalex.org/W1990169944","https://openalex.org/W2020918964","https://openalex.org/W2070705130","https://openalex.org/W2092756565","https://openalex.org/W2101636610","https://openalex.org/W2138172106","https://openalex.org/W2534051629","https://openalex.org/W2589010669","https://openalex.org/W2952684570","https://openalex.org/W2990961515","https://openalex.org/W3094704314","https://openalex.org/W3100690283","https://openalex.org/W3177326518","https://openalex.org/W4240585572","https://openalex.org/W4293179730","https://openalex.org/W4302901408","https://openalex.org/W4367557724","https://openalex.org/W4385732312","https://openalex.org/W4392430356","https://openalex.org/W4401343557"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Scheduling":[1],"problems":[2],"are":[3],"a":[4,13,38,94,101,135],"common":[5],"challenge":[6],"across":[7,114],"various":[8,115],"industries.":[9],"This":[10],"paper":[11],"addresses":[12],"specific":[14],"problem":[15,27,48,69,116],"arising":[16],"in":[17,129],"printed":[18],"circuit":[19,66,75],"board":[20],"(PCB)":[21],"assembly:":[22],"the":[23,64,73,84,108,112,122,148],"parallel":[24],"machines":[25],"scheduling":[26],"with":[28,87],"sequence-dependent":[29],"setup":[30],"times.":[31],"To":[32,82],"address":[33],"this":[34,47,141],"challenge,":[35],"we":[36,92,106,133],"propose":[37],"hybrid":[39],"quantum":[40,52,65,85,103,137],"genetic":[41],"algorithm":[42,86],"(QGA)":[43],"designed":[44],"to":[45,67,99],"solve":[46],"on":[49,57],"an":[50],"error-free":[51],"computer.":[53],"The":[54,144],"development":[55],"focuses":[56],"three":[58],"key":[59,96],"aspects:":[60],"efficient":[61,78],"adaptability":[62],"of":[63,72,80,111],"different":[68],"instances,":[70],"feasibility":[71],"measured":[74],"outputs,":[76],"and":[77],"utilization":[79],"qubits.":[81],"compare":[83],"its":[88],"purely":[89],"classical":[90],"counterpart,":[91],"introduce":[93],"novel":[95],"performance":[97],"indicator":[98],"quantify":[100],"potential":[102,136],"speedup.":[104],"Furthermore,":[105],"evaluate":[107],"convergence":[109,126],"behavior":[110],"solver":[113],"instances.":[117],"Our":[118],"results":[119],"demonstrate":[120],"that":[121],"QGA":[123],"exhibits":[124],"strong":[125],"behavior,":[127],"resulting":[128],"near-optimal":[130],"solutions.":[131],"Additionally,":[132],"identify":[134],"advantage":[138,145],"for":[139],"solving":[140],"practical":[142],"problem.":[143],"increases":[146],"as":[147],"population":[149],"size":[150],"grows.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-19T00:00:00"}