{"id":"https://openalex.org/W4390482042","doi":"https://doi.org/10.1109/ssci52147.2023.10371799","title":"Quantum Representation Based Job Shop Scheduling","display_name":"Quantum Representation Based Job Shop Scheduling","publication_year":2023,"publication_date":"2023-12-05","ids":{"openalex":"https://openalex.org/W4390482042","doi":"https://doi.org/10.1109/ssci52147.2023.10371799"},"language":"en","primary_location":{"id":"doi:10.1109/ssci52147.2023.10371799","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci52147.2023.10371799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Symposium Series on Computational Intelligence (SSCI)","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":"https://openalex.org/A5023057399","display_name":"Kazi Shah Nawaz Ripon","orcid":"https://orcid.org/0000-0002-6551-9714"},"institutions":[{"id":"https://openalex.org/I184531372","display_name":"OsloMet \u2013 Oslo Metropolitan University","ror":"https://ror.org/04q12yn84","country_code":"NO","type":"education","lineage":["https://openalex.org/I184531372"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Kazi Shah Nawaz Ripon","raw_affiliation_strings":["Oslo Metropolitan University,Oslo,Norway","Oslo Metropolitan University, Oslo, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oslo Metropolitan University,Oslo,Norway","institution_ids":["https://openalex.org/I184531372"]},{"raw_affiliation_string":"Oslo Metropolitan University, Oslo, Norway","institution_ids":["https://openalex.org/I184531372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031400688","display_name":"Ashay Singh","orcid":"https://orcid.org/0009-0008-1961-0147"},"institutions":[{"id":"https://openalex.org/I19923696","display_name":"\u00d8stfold University College","ror":"https://ror.org/04gf7fp41","country_code":"NO","type":"education","lineage":["https://openalex.org/I19923696"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Ashay Singh","raw_affiliation_strings":["Ostfold University College,Halden,Norway","Ostfold University College, Halden, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ostfold University College,Halden,Norway","institution_ids":["https://openalex.org/I19923696"]},{"raw_affiliation_string":"Ostfold University College, Halden, Norway","institution_ids":["https://openalex.org/I19923696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3263,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6734389,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1227","last_page":"1233"},"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.9983999729156494,"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.9983999729156494,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9945999979972839,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7582780122756958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6615287661552429},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.599203884601593},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5684539079666138},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5652640461921692},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.49122756719589233},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4890497624874115},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47950464487075806},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.45048025250434875},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4418199956417084},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.43949031829833984},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4161161780357361},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.41144663095474243},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.41021257638931274},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3797256052494049},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18535014986991882},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12995308637619019}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7582780122756958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6615287661552429},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.599203884601593},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5684539079666138},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5652640461921692},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.49122756719589233},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4890497624874115},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47950464487075806},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.45048025250434875},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4418199956417084},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.43949031829833984},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4161161780357361},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.41144663095474243},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.41021257638931274},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3797256052494049},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18535014986991882},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12995308637619019},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci52147.2023.10371799","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci52147.2023.10371799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W97166727","https://openalex.org/W1593881824","https://openalex.org/W1962752774","https://openalex.org/W1982832843","https://openalex.org/W2002372750","https://openalex.org/W2003312239","https://openalex.org/W2020652101","https://openalex.org/W2037337579","https://openalex.org/W2058979950","https://openalex.org/W2068502911","https://openalex.org/W2076371514","https://openalex.org/W2101636610","https://openalex.org/W2115053914","https://openalex.org/W2116400650","https://openalex.org/W2150322710","https://openalex.org/W2153887174","https://openalex.org/W2168676717","https://openalex.org/W2912127016","https://openalex.org/W3004796262","https://openalex.org/W3006229148","https://openalex.org/W3012109984","https://openalex.org/W3137337446","https://openalex.org/W3159134414","https://openalex.org/W3196615270","https://openalex.org/W4293200482","https://openalex.org/W4392487602","https://openalex.org/W6630399596","https://openalex.org/W6682301127","https://openalex.org/W6862038117"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2372008037","https://openalex.org/W3036719625","https://openalex.org/W2225350526","https://openalex.org/W2978148977","https://openalex.org/W2949165180","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2384952691"],"abstract_inverted_index":{"This":[0],"paper":[1,66],"proposes":[2],"a":[3,23,98,110,130],"quantum":[4,63,69,102],"representation-based":[5],"genetic":[6,81,95,123,132],"algorithm":[7,96,124],"for":[8],"solving":[9],"the":[10,17,30,41,60,77,88,106,116,121,138,141],"job-shop":[11,20,89],"scheduling":[12,21,25,90],"problem,":[13],"aiming":[14],"to":[15,53,75,86,104,114,127],"minimize":[16],"makespan.":[18],"The":[19,92,118],"is":[22,125],"typical":[24],"problem":[26],"that":[27,128],"falls":[28],"under":[29],"NP-hard":[31],"combinatorial":[32,147],"optimization":[33,148],"problems":[34],"and":[35,47,72,108],"has":[36],"undergone":[37],"extensive":[38],"investigation":[39],"in":[40,144],"literature.":[42],"Over":[43],"time,":[44],"various":[45],"heuristic":[46],"intelligent":[48],"methods":[49],"have":[50],"been":[51],"developed":[52],"tackle":[54],"this":[55,65],"challenging":[56],"problem.":[57,91],"Inspired":[58],"by":[59],"promise":[61],"of":[62,79,101,120,129,140],"computing,":[64],"explores":[67],"using":[68],"information":[70],"representation":[71,103],"processing":[73],"techniques":[74],"enhance":[76],"performance":[78],"conventional":[80],"algorithms":[82],"on":[83],"classical":[84],"computers":[85],"solve":[87],"proposed":[93,142],"quantum-inspired":[94,122],"employs":[97],"conversion":[99],"mechanism":[100],"code":[105],"schedule;":[107],"utilizes":[109],"rotation":[111],"angle":[112],"table":[113],"update":[115],"population.":[117],"effectiveness":[119],"compared":[126],"standard":[131],"algorithm,":[133],"with":[134],"experimental":[135],"results":[136],"confirming":[137],"potential":[139],"approach":[143],"tackling":[145],"complex":[146],"problems.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}