{"id":"https://openalex.org/W4416874243","doi":"https://doi.org/10.1109/qce65121.2025.00236","title":"Iterative Quantum Annealing for Job Shop Scheduling with a Directed Graph Representation","display_name":"Iterative Quantum Annealing for Job Shop Scheduling with a Directed Graph Representation","publication_year":2025,"publication_date":"2025-08-30","ids":{"openalex":"https://openalex.org/W4416874243","doi":"https://doi.org/10.1109/qce65121.2025.00236"},"language":null,"primary_location":{"id":"doi:10.1109/qce65121.2025.00236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Rebecca Casati","orcid":null},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Rebecca Casati","raw_affiliation_strings":["University of Milan,Department of Physics,Milan,Italy"],"affiliations":[{"raw_affiliation_string":"University of Milan,Department of Physics,Milan,Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120531982","display_name":"Thomas Giudici","orcid":null},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Thomas Giudici","raw_affiliation_strings":["University of Milan,Department of Physics,Milan,Italy"],"affiliations":[{"raw_affiliation_string":"University of Milan,Department of Physics,Milan,Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021943862","display_name":"Pietro Torta","orcid":"https://orcid.org/0000-0002-8508-6442"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pietro Torta","raw_affiliation_strings":["University of Milan,Department of Physics,Milan,Italy"],"affiliations":[{"raw_affiliation_string":"University of Milan,Department of Physics,Milan,Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017727346","display_name":"Enrico Prati","orcid":"https://orcid.org/0000-0001-9839-202X"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enrico Prati","raw_affiliation_strings":["University of Milan,Department of Physics,Milan,Italy"],"affiliations":[{"raw_affiliation_string":"University of Milan,Department of Physics,Milan,Italy","institution_ids":["https://openalex.org/I189158943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189158943"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19423885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2161","last_page":"2169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9750000238418579,"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"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9750000238418579,"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"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.006500000134110451,"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"}},{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.0019000000320374966,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-annealing","display_name":"Quantum annealing","score":0.8233000040054321},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5633000135421753},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.4966000020503998},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.45809999108314514},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4564000070095062},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.45350000262260437},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4431999921798706},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4397999942302704},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.43849998712539673}],"concepts":[{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.8233000040054321},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6553000211715698},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5633000135421753},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.4966000020503998},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4700999855995178},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.45809999108314514},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4564000070095062},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.45350000262260437},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4431999921798706},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4397999942302704},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.43849998712539673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4219000041484833},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.37959998846054077},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.36719998717308044},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.3650999963283539},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.32820001244544983},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.29339998960494995},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.2906000018119812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28690001368522644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.27320000529289246},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26989999413490295},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.26499998569488525},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.2547000050544739},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/qce65121.2025.00236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1583233220","https://openalex.org/W1983624953","https://openalex.org/W2007473024","https://openalex.org/W2014366273","https://openalex.org/W2020459421","https://openalex.org/W2028826326","https://openalex.org/W2031828766","https://openalex.org/W2040797887","https://openalex.org/W2058599268","https://openalex.org/W2105614108","https://openalex.org/W2518264398","https://openalex.org/W2564229214","https://openalex.org/W2747092504","https://openalex.org/W2951140974","https://openalex.org/W2990475267","https://openalex.org/W3194323641","https://openalex.org/W4283660201","https://openalex.org/W4290861662","https://openalex.org/W4386982579","https://openalex.org/W4388280613","https://openalex.org/W4389162447","https://openalex.org/W4396498622","https://openalex.org/W4403834027","https://openalex.org/W4406261607","https://openalex.org/W4411061038"],"related_works":[],"abstract_inverted_index":{"A":[0],"promising":[1],"use":[2],"of":[3,12,40,81,88,134,165,170,179,201,215],"quantum":[4,34,64,202],"computers":[5],"lies":[6],"in":[7,78,137],"the":[8,37,71,79,101,132,138,149,171,180,197,205,212,216],"logistics":[9],"and":[10,22,66,99],"scheduling":[11,51,76,84,103],"industrial":[13],"problems,":[14,52],"such":[15],"as":[16,106],"space":[17],"mission":[18],"planning,":[19],"maritime":[20],"management,":[21],"many":[23,55],"others.":[24],"This":[25,188],"field":[26],"is":[27],"expected":[28],"to":[29,49,74,92,191,196],"provide":[30],"useful":[31],"applications":[32,200],"for":[33,117,185,204],"computing":[35],"at":[36],"current":[38],"stage":[39],"hardware":[41,73],"development.":[42],"Quantum":[43],"annealing":[44,65,203],"techniques":[45,68],"have":[46],"been":[47],"proposed":[48],"solve":[50,75],"along":[53],"with":[54],"other":[56],"optimization":[57],"problems.":[58],"In":[59],"this":[60],"work,":[61],"we":[62,208],"test":[63],"hybrid":[67],"based":[69],"on":[70],"D-Wave":[72,150],"problems":[77],"framework":[80],"job":[82],"shop":[83],"(JSP),":[85],"which":[86,129,174],"consists":[87],"optimally":[89],"assigning":[90],"operations":[91],"certain":[93],"resources,":[94],"while":[95],"satisfying":[96],"specific":[97],"constraints":[98],"minimizing":[100],"total":[102],"time,":[104],"known":[105],"timespan.":[107],"We":[108,121],"devised":[109],"an":[110,176],"iterative":[111,125,156],"algorithm":[112,157],"that":[113,220],"produces":[114],"valid":[115],"schedules":[116],"decreasing":[118],"timespan":[119,228],"values.":[120],"implemented":[122],"a":[123,159,221,226],"refined":[124],"variable":[126],"pruning":[127],"technique,":[128],"significantly":[130,192],"reduces":[131],"number":[133],"spin":[135],"variables":[136],"corresponding":[139],"Ising":[140],"model,":[141],"whose":[142],"low-energy":[143],"configurations":[144],"are":[145],"sampled":[146],"by":[147],"using":[148],"Hybrid":[151],"Solver":[152],"Service.":[153],"Our":[154],"novel":[155],"leverages":[158],"directed":[160],"acyclic":[161],"graph":[162],"(DAG)":[163],"representation":[164],"partial":[166],"or":[167],"complete":[168],"solutions":[169],"JSP":[172],"instance,":[173],"enables":[175],"efficient":[177,223],"update":[178],"feasible":[181],"processing":[182],"time":[183],"windows":[184],"each":[186],"operation.":[187],"approach":[189],"leads":[190],"improved":[193],"results":[194],"compared":[195],"standard":[198],"state-of-the-art":[199],"JSP.":[206],"Remarkably,":[207],"can":[209,229],"often":[210],"prove":[211],"absolute":[213],"optimality":[214],"obtained":[217],"solution,":[218],"namely":[219],"more":[222],"schedule":[224],"within":[225],"shorter":[227],"not":[230],"exist.":[231]},"counts_by_year":[],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-12-01T00:00:00"}