Application of quantum approximate optimization algorithm to job shop scheduling problem
•Demonstrate how to efficiently apply Quantum Approximate Optimization Algorithm (QAOA) to Job Shop Scheduling Problem (JSSP).•Investigation of the behaviour of the QAOA-based quantum algorithm in a series of experiments using quantum noiseless simulations.•Evaluation of the quantum algorithm’s effi...
Uložené v:
| Vydané v: | European journal of operational research Ročník 310; číslo 2; s. 518 - 528 |
|---|---|
| Hlavní autori: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
16.10.2023
|
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •Demonstrate how to efficiently apply Quantum Approximate Optimization Algorithm (QAOA) to Job Shop Scheduling Problem (JSSP).•Investigation of the behaviour of the QAOA-based quantum algorithm in a series of experiments using quantum noiseless simulations.•Evaluation of the quantum algorithm’s efficiency and accuracy, particularly the relation between makespan and energy in achieving feasible and infeasible solutions.•Applicability of quantum optimization algorithms and appropriate technical steps for application developers interested in applying gate-based quantum approaches for solving other scheduling problems.
The Job Shop Scheduling Problem (JSSP) has always been considered as one of the most complex and industry essential scheduling problems. Optimizing the makespan of a given schedule generally involves using dedicated algorithms, local search strategies, or metaheuristics. These approaches, however, heavily rely on classical computational power, which is bounded by the physical limits of microcontrollers and power issues. Inspired by the promising results achieved for Quantum Annealing (QA) based approaches to solve JSSP instances, we propose a new approach that uses gate-model quantum architecture as an alternative to QA. We find that we can make use of the time-indexed JSSP instance representation to build a cost Hamiltonian, which can be embedded into Quantum Approximate Optimization Algorithm (QAOA) to find an optimal solution to a basic JSSP instance. We demonstrate the use of QAOA to solve the JSSP, and we evaluate its efficiency and accuracy for this problem from experimental results, as there is an increased urgency to demonstrate the applicability of quantum optimization algorithms. We also find that optimal variational parameters form patterns that can facilitate computation in bigger quantum circuits. Additionally, we compare the obtained noiseless simulation results of gate-model quantum circuits demonstrating the relationship between two evaluation criteria - makespan and energy. Finally, we analyze and present the overall performance of our approach with the increasing deadline and simulated depth of QAOA circuits. |
|---|---|
| AbstractList | •Demonstrate how to efficiently apply Quantum Approximate Optimization Algorithm (QAOA) to Job Shop Scheduling Problem (JSSP).•Investigation of the behaviour of the QAOA-based quantum algorithm in a series of experiments using quantum noiseless simulations.•Evaluation of the quantum algorithm’s efficiency and accuracy, particularly the relation between makespan and energy in achieving feasible and infeasible solutions.•Applicability of quantum optimization algorithms and appropriate technical steps for application developers interested in applying gate-based quantum approaches for solving other scheduling problems.
The Job Shop Scheduling Problem (JSSP) has always been considered as one of the most complex and industry essential scheduling problems. Optimizing the makespan of a given schedule generally involves using dedicated algorithms, local search strategies, or metaheuristics. These approaches, however, heavily rely on classical computational power, which is bounded by the physical limits of microcontrollers and power issues. Inspired by the promising results achieved for Quantum Annealing (QA) based approaches to solve JSSP instances, we propose a new approach that uses gate-model quantum architecture as an alternative to QA. We find that we can make use of the time-indexed JSSP instance representation to build a cost Hamiltonian, which can be embedded into Quantum Approximate Optimization Algorithm (QAOA) to find an optimal solution to a basic JSSP instance. We demonstrate the use of QAOA to solve the JSSP, and we evaluate its efficiency and accuracy for this problem from experimental results, as there is an increased urgency to demonstrate the applicability of quantum optimization algorithms. We also find that optimal variational parameters form patterns that can facilitate computation in bigger quantum circuits. Additionally, we compare the obtained noiseless simulation results of gate-model quantum circuits demonstrating the relationship between two evaluation criteria - makespan and energy. Finally, we analyze and present the overall performance of our approach with the increasing deadline and simulated depth of QAOA circuits. |
| Author | Waligóra, Grzegorz Kurowski, Krzysztof Pecyna, Tomasz Wȩglarz, Jan Slysz, Mateusz Różycki, Rafał |
| Author_xml | – sequence: 1 givenname: Krzysztof orcidid: 0000-0002-4478-6119 surname: Kurowski fullname: Kurowski, Krzysztof email: krzysztof.kurowski@man.poznan.pl organization: Poznan Supercomputing and Networking Center, Poznan, IBCH PAS, Poland – sequence: 2 givenname: Tomasz orcidid: 0000-0001-7473-3360 surname: Pecyna fullname: Pecyna, Tomasz organization: Poznan Supercomputing and Networking Center, Poznan, IBCH PAS, Poland – sequence: 3 givenname: Mateusz surname: Slysz fullname: Slysz, Mateusz organization: Poznan Supercomputing and Networking Center, Poznan, IBCH PAS, Poland – sequence: 4 givenname: Rafał surname: Różycki fullname: Różycki, Rafał organization: Poznan University of Technology, Institute of Computing Science, Poznan, Poland – sequence: 5 givenname: Grzegorz surname: Waligóra fullname: Waligóra, Grzegorz organization: Poznan University of Technology, Institute of Computing Science, Poznan, Poland – sequence: 6 givenname: Jan surname: Wȩglarz fullname: Wȩglarz, Jan organization: Poznan University of Technology, Institute of Computing Science, Poznan, Poland |
| BookMark | eNp9kMtqwzAQRUVJoUnaH-hKP2B3JNmWA92E0BcEusmiOyHLUiJjW66klLZfX6fuqovAhdnMGeaeBZr1rtcI3RJICZDirkl143xKgbIUxhB2geak5DQpygJmaA6M84RSwq_QIoQGAEhO8jl6Ww9Da5WM1vXYGfx-lH08dlgOg3eftpNRYzdE29nvaUe2e-dtPHQ4Oty4CoeDG3BQB10fW9vv8chVre6u0aWRbdA3f3OJdo8Pu81zsn19etmst4nKYBUTWdRMEcMrlfPMGKKM5ApkxlZ5XnGlTEVJxaAqM10WpZGUM4C6IBSKVTmyS1ROZ5V3IXhthLLx99PopW0FAXESJBpxEiROggSMIWxE6T908GNh_3Ueup8gPXb6sNqLoKzula6t1yqK2tlz-A8pQ4Qq |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2024_09_005 crossref_primary_10_1016_j_future_2025_107934 crossref_primary_10_1109_TQE_2024_3439135 crossref_primary_10_1016_j_physa_2024_129986 crossref_primary_10_1002_qute_202400253 crossref_primary_10_1016_j_ejor_2024_12_016 crossref_primary_10_3390_app14188099 crossref_primary_10_3390_math11153423 crossref_primary_10_1007_s10288_023_00549_1 crossref_primary_10_1007_s11128_025_04776_9 crossref_primary_10_1088_2058_9565_ad9cba crossref_primary_10_1016_j_engappai_2025_110431 crossref_primary_10_1038_s41598_024_76967_w crossref_primary_10_20935_AcadQuant7900 crossref_primary_10_1186_s40323_025_00298_2 crossref_primary_10_1007_s10479_024_06253_5 crossref_primary_10_1007_s00500_025_10540_z crossref_primary_10_1109_TSE_2024_3479421 crossref_primary_10_1371_journal_pone_0319257 |
| Cites_doi | 10.1023/A:1021197120431 10.1016/S0377-2217(99)00486-5 10.1098/rspa.1992.0167 10.1287/mnsc.44.2.262 10.1016/0377-2217(95)00362-2 10.1007/s10951-017-0547-8 10.1007/BF01721162 10.1007/BF01011339 10.1038/s41567-021-01356-3 10.1137/S0097539705447323 10.1038/s41567-020-01105-y 10.1016/S0377-2217(99)00158-7 10.1016/0377-2217(94)90379-4 10.1016/S0377-2217(98)00113-1 10.1103/PhysRevA.106.062414 10.1038/ncomms3067 10.1145/237814.237866 10.1103/PhysRevX.10.021067 10.1103/PhysRevE.58.5355 10.1016/0377-2217(93)90174-L 10.22331/q-2018-08-06-79 10.1007/BF00670071 10.1109/QCE49297.2020.00018 10.1007/s10479-005-2443-4 10.1007/BF02650179 10.1137/S0097539796300921 10.1103/PRXQuantum.2.010101 10.1088/1749-4680/7/1/015006 10.1145/3478519 10.1119/1.1463744 10.1287/mnsc.34.3.391 10.3389/fphy.2014.00005 10.1016/j.cor.2006.02.024 10.1006/jcss.1999.1651 10.1103/PhysRevResearch.3.033195 10.1070/RM1997v052n06ABEH002155 10.1038/s41592-019-0686-2 10.1016/j.jocs.2020.101093 10.1287/ijoc.8.3.302 10.1103/PhysRevApplied.14.034009 10.1016/0377-2217(91)90304-E |
| ContentType | Journal Article |
| Copyright | 2023 Poznan Supercomputing and Networking Center IBCH PAS |
| Copyright_xml | – notice: 2023 Poznan Supercomputing and Networking Center IBCH PAS |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.ejor.2023.03.013 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 528 |
| ExternalDocumentID | 10_1016_j_ejor_2023_03_013 S0377221723002072 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6I. 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c409t-a6d3c1f7bc574ff1cfa7c0a43955b7ccfb21b30b84e868fa27300d61206986d3 |
| ISICitedReferencesCount | 28 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001006829600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 07:18:06 EST 2025 Tue Nov 18 20:59:33 EST 2025 Fri Feb 23 02:35:46 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Job shop scheduling problem Scheduling Quantum approximate optimization algorithm Heuristics Computing science |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c409t-a6d3c1f7bc574ff1cfa7c0a43955b7ccfb21b30b84e868fa27300d61206986d3 |
| ORCID | 0000-0001-7473-3360 0000-0002-4478-6119 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.ejor.2023.03.013 |
| PageCount | 11 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2023_03_013 crossref_primary_10_1016_j_ejor_2023_03_013 elsevier_sciencedirect_doi_10_1016_j_ejor_2023_03_013 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-10-16 |
| PublicationDateYYYYMMDD | 2023-10-16 |
| PublicationDate_xml | – month: 10 year: 2023 text: 2023-10-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Powell (bib0044) 1994 Zhang, Li, Rao, Guan (bib0057) 2008; 35 Nielsen, M. A., & Chuang, I. (2002). Quantum computation and quantum information. Brucker, Jurisch (bib0013) 1993; 64 Virtanen, Gommers, Oliphant, Haberland, Reddy, Cournapeau, SciPy 1.0 Contributors (bib0055) 2020; 17 Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Tabi, El-Safty, Kallus, H’aga, Kozsik, Glos, Zimbor’as (bib0051) 2020 Ralli, Love, Tranter, Coveney (bib0047) 2021; 3 Radzihovsky, M., Murphy, J., & Mason, S. (2019). A qaoa solution to the traveling salesman problem using pyquil. Fortnow, Rogers (bib0026) 1999; 59 Khumalo, Chieza, Prag, Woolway (bib0035) 2022 Adams, Balas, Zawack (bib0001) 1988; 34 Bernstein, Vazirani (bib0007) 1997; 26 Preskill (bib0045) 2018; 2 Bernstein, Vazirani (bib0006) 1993 Dorndorf, Pesch, Phan-Huy (bib0021) 2002; 115 . Shor (bib0048) 1994 Kurowski, Wȩglarz, Subocz, Różycki, Waligóra (bib0037) 2020 Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000). Quantum computation by adiabatic evolution. Stilck França, Garcia-Patron (bib0050) 2021; 17 Magann, Rudinger, Grace, Sarovar (bib0040) 2022; 106 Balas, Vazacopoulos (bib0004) 1998; 44 Błażewicz, Domschke, Pesch (bib0008) 1996; 93 Aharonov, Van Dam, Kempe, Landau, Lloyd, Regev (bib0002) 2007; 37 Benioff (bib0005) 1980; 22 Boixo, Albash, Spedalieri, Chancellor, Lidar (bib0012) 2013; 4 Zhou, Wang, Choi, Pichler, Lukin (bib0058) 2020; 10 doi Błażewicz, Dror, Wȩglarz (bib0009) 1991; 51 Haupt (bib0030) 1989; 11 Hadfield (bib0028) 2021; 2 Cerezo, Arrasmith, Babbush, Benjamin, Endo, Fujii, Coles (bib0015) 2021 Farhi, Goldstone, Gutmann (bib0022) 2014 Jain, Meeran (bib0033) 1999; 113 Carlier, Pinson (bib0014) 1994; 78 Coveney, Highfield (bib0016) 2020; 46 Magann, Arenz, Grace, Ho, Kosut, McClean, Sarovar (bib0039) 2021; 2 Pauli (bib0042) 1927; 43 van Hoorn (bib0031) 2018; 21 Yao (bib0056) 1993 Błażewicz, Ecker, Pesch, Schmidt, Sterna, Wȩglarz (bib0010) 2019 De Palma, Marvian, Rouzé, França (bib0018) 2022 Kitaev (bib0036) 1997; 52 Venturelli, Marchand, Rojo (bib0053) 2016 Vikstål, Grönkvist, Svensson, Andersson, Johansson, Ferrini (bib0054) 2020; 14 Deutsch, Jozsa (bib0020) 1992; 439 Simon (bib0049) 1994 Artigues, Lopez, Ayache (bib0003) 2005; 138 Vaessens, Aarts, Lenstra (bib0052) 1996; 8 Błażewicz, Pesch, Sterna (bib0011) 2000; 127 Lucas (bib0038) 2014; 2 Kadowaki, Nishimori (bib0034) 1998; 58 Pezzella, Merelli (bib0043) 2000; 120 Humble, McCaskey, Bennink, Billings, D’Azevedo, Sullivan, Seddiqi (bib0032) 2013; 7 Harrigan, Sung, Neeley, Satzinger, Arute, Arya, Boixo (bib0029) 2021; 17 Crooks (bib0017) 2018 Feynman (bib0025) 1982; 21 Deutsch (bib0019) 1985; 24 Farhi, Harrow (bib0024) 2019 Bernstein (10.1016/j.ejor.2023.03.013_bib0007) 1997; 26 Adams (10.1016/j.ejor.2023.03.013_bib0001) 1988; 34 Benioff (10.1016/j.ejor.2023.03.013_bib0005) 1980; 22 Błażewicz (10.1016/j.ejor.2023.03.013_bib0011) 2000; 127 Vaessens (10.1016/j.ejor.2023.03.013_bib0052) 1996; 8 Carlier (10.1016/j.ejor.2023.03.013_bib0014) 1994; 78 Błażewicz (10.1016/j.ejor.2023.03.013_bib0008) 1996; 93 Farhi (10.1016/j.ejor.2023.03.013_bib0022) 2014 10.1016/j.ejor.2023.03.013_bib0027 Powell (10.1016/j.ejor.2023.03.013_bib0044) 1994 Pauli (10.1016/j.ejor.2023.03.013_bib0042) 1927; 43 Dorndorf (10.1016/j.ejor.2023.03.013_bib0021) 2002; 115 10.1016/j.ejor.2023.03.013_bib0023 Virtanen (10.1016/j.ejor.2023.03.013_bib0055) 2020; 17 Kadowaki (10.1016/j.ejor.2023.03.013_bib0034) 1998; 58 Hadfield (10.1016/j.ejor.2023.03.013_bib0028) 2021; 2 Crooks (10.1016/j.ejor.2023.03.013_bib0017) 2018 Balas (10.1016/j.ejor.2023.03.013_bib0004) 1998; 44 Deutsch (10.1016/j.ejor.2023.03.013_bib0019) 1985; 24 Vikstål (10.1016/j.ejor.2023.03.013_bib0054) 2020; 14 Boixo (10.1016/j.ejor.2023.03.013_bib0012) 2013; 4 Magann (10.1016/j.ejor.2023.03.013_bib0040) 2022; 106 Błażewicz (10.1016/j.ejor.2023.03.013_bib0010) 2019 De Palma (10.1016/j.ejor.2023.03.013_bib0018) 2022 Ralli (10.1016/j.ejor.2023.03.013_bib0047) 2021; 3 Aharonov (10.1016/j.ejor.2023.03.013_bib0002) 2007; 37 Pezzella (10.1016/j.ejor.2023.03.013_bib0043) 2000; 120 Fortnow (10.1016/j.ejor.2023.03.013_bib0026) 1999; 59 van Hoorn (10.1016/j.ejor.2023.03.013_bib0031) 2018; 21 Magann (10.1016/j.ejor.2023.03.013_bib0039) 2021; 2 Shor (10.1016/j.ejor.2023.03.013_bib0048) 1994 Tabi (10.1016/j.ejor.2023.03.013_bib0051) 2020 Haupt (10.1016/j.ejor.2023.03.013_bib0030) 1989; 11 Farhi (10.1016/j.ejor.2023.03.013_bib0024) 2019 10.1016/j.ejor.2023.03.013_bib0041 Cerezo (10.1016/j.ejor.2023.03.013_bib0015) 2021 10.1016/j.ejor.2023.03.013_bib0046 Stilck França (10.1016/j.ejor.2023.03.013_bib0050) 2021; 17 Bernstein (10.1016/j.ejor.2023.03.013_bib0006) 1993 Artigues (10.1016/j.ejor.2023.03.013_bib0003) 2005; 138 Feynman (10.1016/j.ejor.2023.03.013_bib0025) 1982; 21 Lucas (10.1016/j.ejor.2023.03.013_sbref0036) 2014; 2 Humble (10.1016/j.ejor.2023.03.013_bib0032) 2013; 7 Venturelli (10.1016/j.ejor.2023.03.013_bib0053) 2016 Yao (10.1016/j.ejor.2023.03.013_bib0056) 1993 Khumalo (10.1016/j.ejor.2023.03.013_bib0035) 2022 Preskill (10.1016/j.ejor.2023.03.013_bib0045) 2018; 2 Błażewicz (10.1016/j.ejor.2023.03.013_bib0009) 1991; 51 Kitaev (10.1016/j.ejor.2023.03.013_bib0036) 1997; 52 Zhang (10.1016/j.ejor.2023.03.013_bib0057) 2008; 35 Jain (10.1016/j.ejor.2023.03.013_bib0033) 1999; 113 Zhou (10.1016/j.ejor.2023.03.013_bib0058) 2020; 10 Brucker (10.1016/j.ejor.2023.03.013_bib0013) 1993; 64 Simon (10.1016/j.ejor.2023.03.013_bib0049) 1994 Coveney (10.1016/j.ejor.2023.03.013_sbref0016) 2020; 46 Kurowski (10.1016/j.ejor.2023.03.013_bib0037) 2020 Deutsch (10.1016/j.ejor.2023.03.013_bib0020) 1992; 439 Harrigan (10.1016/j.ejor.2023.03.013_bib0029) 2021; 17 |
| References_xml | – start-page: 1 year: 2022 end-page: 16 ident: bib0035 article-title: An investigation of ibm quantum computing device performance on combinatorial optimisation problems publication-title: Neural Computing and Applications – reference: Radzihovsky, M., Murphy, J., & Mason, S. (2019). A qaoa solution to the traveling salesman problem using pyquil. – start-page: 11 year: 1993 end-page: 20 ident: bib0006 article-title: Quantum complexity theory publication-title: Proceedings of the twenty-fifth annual acm symposium on theory of computing – year: 2019 ident: bib0024 article-title: Quantum supremacy through the quantum approximate optimization algorithm publication-title: arXiv:1602.07674: Quantum Physics – year: 2014 ident: bib0022 article-title: A quantum approximate optimization algorithm publication-title: arXiv:1411.4028: Quantum Physics – volume: 11 start-page: 3 year: 1989 end-page: 16 ident: bib0030 article-title: A survey of priority-rule based scheduling publication-title: OR Spektrum – year: 2018 ident: bib0017 article-title: Performance of the quantum approximate optimization algorithm on the maximum cut problem publication-title: arXiv preprint – volume: 43 start-page: 601 year: 1927 end-page: 623 ident: bib0042 article-title: Zur quantenmechanik des magnetischen elektrons publication-title: Zeitschrift für Physik A Hadrons and Nuclei – volume: 64 start-page: 156 year: 1993 end-page: 167 ident: bib0013 article-title: A new lower bound for the job shop scheduling problem publication-title: European Journal of Operational Research – start-page: 502 year: 2020 end-page: 515 ident: bib0037 article-title: Hybrid quantum annealing heuristic method for solving job shop scheduling problem publication-title: Computational science – iccs 2020 – volume: 17 start-page: 261 year: 2020 end-page: 272 ident: bib0055 article-title: Scipy 1.0: Fundamental algorithms for scientific computing in python publication-title: Nature Methods – volume: 44 start-page: 262 year: 1998 end-page: 275 ident: bib0004 article-title: Guided local search with shifting bottleneck for job shop scheduling publication-title: Management Science – year: 2022 ident: bib0018 article-title: Limitations of variational quantum algorithms: Aquantum optimal transport approach publication-title: arXiv preprint – year: 2021 ident: bib0015 article-title: Variational quantum algorithms publication-title: ArXiv – volume: 93 start-page: 1 year: 1996 end-page: 33 ident: bib0008 article-title: The job shop scheduling problem: Conventional and new solution techniques publication-title: European Journal of Operational Research – start-page: 124 year: 1994 end-page: 134 ident: bib0048 article-title: Algorithms for quantum computation: discrete logarithms and factoring publication-title: Proceedings 35th annual symposium on foundations of computer science – volume: 34 start-page: 391 year: 1988 end-page: 401 ident: bib0001 article-title: The shifting bottleneck procedure for job shop scheduling publication-title: Management Science – volume: 35 start-page: 282 year: 2008 end-page: 294 ident: bib0057 article-title: A very fast TS/SA algorithm for the job shop scheduling problem publication-title: Computers & Operations Research – volume: 22 start-page: 563 year: 1980 end-page: 591 ident: bib0005 article-title: The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by turing machines publication-title: Journal of Statistical Physics – volume: 4 start-page: 2067 year: 2013 ident: bib0012 article-title: Experimental signature of programmable quantum annealing publication-title: Nature Communications – volume: 115 start-page: 125 year: 2002 end-page: 145 ident: bib0021 article-title: Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem publication-title: Annals of Operations Research – year: 2016 ident: bib0053 article-title: Quantum annealing implementation of job-shop scheduling publication-title: arXiv:1506.08479: Quantum Physics – volume: 24 start-page: 1 year: 1985 end-page: 41 ident: bib0019 article-title: Quantum theory as a universal physical theory publication-title: International Journal of Theoretical Physics – volume: 2 start-page: 79 year: 2018 ident: bib0045 article-title: Quantum computing in the NISQ era and beyond publication-title: Quantum – volume: 51 start-page: 283 year: 1991 end-page: 300 ident: bib0009 article-title: Mathematical programming formulations for machine scheduling: A survey publication-title: European Journal of Operational Research – volume: 52 start-page: 1191 year: 1997 ident: bib0036 article-title: Quantum computations: Algorithms and error correction publication-title: Russian Mathematical Surveys – volume: 113 start-page: 390 year: 1999 end-page: 434 ident: bib0033 article-title: Deterministic job shop scheduling: Past, present and future publication-title: European Journal of Operational Research – volume: 37 start-page: 166 year: 2007 end-page: 194 ident: bib0002 article-title: Adiabatic quantum computation is equivalent to standard quantum computation publication-title: SIAM Journal on Computing – volume: 21 start-page: 467 year: 1982 end-page: 488 ident: bib0025 article-title: Simulating physics with computers publication-title: International Journal of Theoretical Physics – reference: . – year: 2019 ident: bib0010 article-title: Handbook on scheduling: From theory to practice – reference: . doi: – volume: 8 start-page: 302 year: 1996 end-page: 317 ident: bib0052 article-title: Job shop scheduling by local search publication-title: INFORMS Journal of Computing – volume: 17 start-page: 1221 year: 2021 end-page: 1227 ident: bib0050 article-title: Limitations of optimization algorithms on noisy quantum devices publication-title: Nature Physics – volume: 26 start-page: 1411 year: 1997 end-page: 1473 ident: bib0007 article-title: Quantum complexity theory publication-title: SIAM Journal on Computing – volume: 78 start-page: 146 year: 1994 end-page: 161 ident: bib0014 article-title: Adjustment of heads and tails for the job shop problem publication-title: European Journal of Operational Research – volume: 2 start-page: 010101 year: 2021 ident: bib0039 article-title: From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms publication-title: PRX Quantum – volume: 120 start-page: 297 year: 2000 end-page: 310 ident: bib0043 article-title: Tabu search method guided by shifting bottleneck for the job shop scheduling problem publication-title: European Journal of Operational Research – volume: 106 start-page: 062414 year: 2022 ident: bib0040 article-title: Lyapunov-control-inspired strategies for quantum combinatorial optimization publication-title: Physical Review A – start-page: 51 year: 1994 end-page: 67 ident: bib0044 article-title: A direct search optimization method that models the objective and constraint functions by linear interpolation publication-title: Advances in optimization and numerical analysis – volume: 59 start-page: 240 year: 1999 end-page: 252 ident: bib0026 article-title: Complexity limitations on quantum computation publication-title: Journal of Computer and System Sciences – start-page: 56 year: 2020 end-page: 62 ident: bib0051 article-title: Quantum optimization for the graph coloring problem with space-efficient embedding publication-title: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) – volume: 2 start-page: 1 year: 2021 end-page: 21 ident: bib0028 article-title: On the representation of boolean and real functions as hamiltonians for quantum computing publication-title: ACM Transactions on Quantum Computing – volume: 58 start-page: 5355 year: 1998 end-page: 5363 ident: bib0034 article-title: Quantum annealing in the transverse ising model publication-title: Physical Review E – volume: 2 start-page: 5 year: 2014 ident: bib0038 article-title: Ising formulations of many NP problems publication-title: Frontiers in Physics – volume: 127 start-page: 317 year: 2000 end-page: 331 ident: bib0011 article-title: The disjunctive graph machine representation of the job shop problem publication-title: European Journal of Operational Research – volume: 138 start-page: 21 year: 2005 end-page: 52 ident: bib0003 article-title: Schedule generation schemes for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis publication-title: Annals of Operations Research – reference: Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. – start-page: 352 year: 1993 end-page: 361 ident: bib0056 article-title: Quantum circuit complexity publication-title: Proceedings of 1993 ieee 34th annual foundations of computer science – volume: 17 start-page: 332 year: 2021 end-page: 336 ident: bib0029 article-title: Quantum approximate optimization of non-planar graph problems on a planar superconducting processor publication-title: Nature Physics – volume: 7 start-page: 015006 year: 2013 ident: bib0032 article-title: An integrated programming and development environment for adiabatic quantum optimization publication-title: Computational Science & Discovery – reference: Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000). Quantum computation by adiabatic evolution. – reference: . – start-page: 116 year: 1994 end-page: 123 ident: bib0049 article-title: On the power of quantum computation publication-title: Proceedings of the 35th annual symposium on foundations of computer science – volume: 3 start-page: 033195 year: 2021 ident: bib0047 article-title: Implementation of measurement reduction for the variational quantum eigensolver publication-title: Physical Review Research – volume: 14 start-page: 034009 year: 2020 ident: bib0054 article-title: Applying the quantum approximate optimization algorithm to the tail-assignment problem publication-title: Physical Review Applied – volume: 10 start-page: 021067 year: 2020 ident: bib0058 article-title: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices publication-title: Physical Review X – reference: Nielsen, M. A., & Chuang, I. (2002). Quantum computation and quantum information. – volume: 46 start-page: 101093 year: 2020 ident: bib0016 article-title: From digital hype to analogue reality: Universal simulation beyond the quantum and exascale eras publication-title: Journal of Computational Science – volume: 21 start-page: 127 year: 2018 end-page: 128 ident: bib0031 article-title: The current state of bounds on benchmark instances of the job-shop scheduling problem publication-title: Journal of Scheduling – volume: 439 start-page: 553 year: 1992 end-page: 558 ident: bib0020 article-title: Rapid solution of problems by quantum computation publication-title: Proc. R. Soc. Lond. A – volume: 115 start-page: 125 year: 2002 ident: 10.1016/j.ejor.2023.03.013_bib0021 article-title: Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem publication-title: Annals of Operations Research doi: 10.1023/A:1021197120431 – year: 2014 ident: 10.1016/j.ejor.2023.03.013_bib0022 article-title: A quantum approximate optimization algorithm publication-title: arXiv:1411.4028: Quantum Physics – volume: 127 start-page: 317 issue: 2 year: 2000 ident: 10.1016/j.ejor.2023.03.013_bib0011 article-title: The disjunctive graph machine representation of the job shop problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00486-5 – volume: 439 start-page: 553 year: 1992 ident: 10.1016/j.ejor.2023.03.013_bib0020 article-title: Rapid solution of problems by quantum computation publication-title: Proc. R. Soc. Lond. A doi: 10.1098/rspa.1992.0167 – volume: 44 start-page: 262 issue: 2 year: 1998 ident: 10.1016/j.ejor.2023.03.013_bib0004 article-title: Guided local search with shifting bottleneck for job shop scheduling publication-title: Management Science doi: 10.1287/mnsc.44.2.262 – volume: 93 start-page: 1 issue: 1 year: 1996 ident: 10.1016/j.ejor.2023.03.013_bib0008 article-title: The job shop scheduling problem: Conventional and new solution techniques publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00362-2 – year: 2018 ident: 10.1016/j.ejor.2023.03.013_bib0017 article-title: Performance of the quantum approximate optimization algorithm on the maximum cut problem publication-title: arXiv preprint – volume: 21 start-page: 127 issue: 1 year: 2018 ident: 10.1016/j.ejor.2023.03.013_bib0031 article-title: The current state of bounds on benchmark instances of the job-shop scheduling problem publication-title: Journal of Scheduling doi: 10.1007/s10951-017-0547-8 – year: 2019 ident: 10.1016/j.ejor.2023.03.013_bib0024 article-title: Quantum supremacy through the quantum approximate optimization algorithm publication-title: arXiv:1602.07674: Quantum Physics – volume: 11 start-page: 3 issue: 1 year: 1989 ident: 10.1016/j.ejor.2023.03.013_bib0030 article-title: A survey of priority-rule based scheduling publication-title: OR Spektrum doi: 10.1007/BF01721162 – start-page: 124 year: 1994 ident: 10.1016/j.ejor.2023.03.013_bib0048 article-title: Algorithms for quantum computation: discrete logarithms and factoring – start-page: 116 year: 1994 ident: 10.1016/j.ejor.2023.03.013_bib0049 article-title: On the power of quantum computation – volume: 22 start-page: 563 issue: 5 year: 1980 ident: 10.1016/j.ejor.2023.03.013_bib0005 article-title: The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by turing machines publication-title: Journal of Statistical Physics doi: 10.1007/BF01011339 – year: 2019 ident: 10.1016/j.ejor.2023.03.013_bib0010 – volume: 17 start-page: 1221 issue: 11 year: 2021 ident: 10.1016/j.ejor.2023.03.013_bib0050 article-title: Limitations of optimization algorithms on noisy quantum devices publication-title: Nature Physics doi: 10.1038/s41567-021-01356-3 – start-page: 51 year: 1994 ident: 10.1016/j.ejor.2023.03.013_bib0044 article-title: A direct search optimization method that models the objective and constraint functions by linear interpolation – volume: 37 start-page: 166 issue: 1 year: 2007 ident: 10.1016/j.ejor.2023.03.013_bib0002 article-title: Adiabatic quantum computation is equivalent to standard quantum computation publication-title: SIAM Journal on Computing doi: 10.1137/S0097539705447323 – volume: 17 start-page: 332 issue: 3 year: 2021 ident: 10.1016/j.ejor.2023.03.013_bib0029 article-title: Quantum approximate optimization of non-planar graph problems on a planar superconducting processor publication-title: Nature Physics doi: 10.1038/s41567-020-01105-y – volume: 120 start-page: 297 issue: 2 year: 2000 ident: 10.1016/j.ejor.2023.03.013_bib0043 article-title: Tabu search method guided by shifting bottleneck for the job shop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00158-7 – volume: 78 start-page: 146 issue: 2 year: 1994 ident: 10.1016/j.ejor.2023.03.013_bib0014 article-title: Adjustment of heads and tails for the job shop problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90379-4 – volume: 113 start-page: 390 issue: 2 year: 1999 ident: 10.1016/j.ejor.2023.03.013_bib0033 article-title: Deterministic job shop scheduling: Past, present and future publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00113-1 – volume: 106 start-page: 062414 issue: 6 year: 2022 ident: 10.1016/j.ejor.2023.03.013_bib0040 article-title: Lyapunov-control-inspired strategies for quantum combinatorial optimization publication-title: Physical Review A doi: 10.1103/PhysRevA.106.062414 – volume: 4 start-page: 2067 year: 2013 ident: 10.1016/j.ejor.2023.03.013_bib0012 article-title: Experimental signature of programmable quantum annealing publication-title: Nature Communications doi: 10.1038/ncomms3067 – ident: 10.1016/j.ejor.2023.03.013_bib0027 doi: 10.1145/237814.237866 – start-page: 352 year: 1993 ident: 10.1016/j.ejor.2023.03.013_bib0056 article-title: Quantum circuit complexity – year: 2021 ident: 10.1016/j.ejor.2023.03.013_bib0015 article-title: Variational quantum algorithms publication-title: ArXiv – volume: 10 start-page: 021067 issue: 2 year: 2020 ident: 10.1016/j.ejor.2023.03.013_bib0058 article-title: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices publication-title: Physical Review X doi: 10.1103/PhysRevX.10.021067 – volume: 58 start-page: 5355 issue: 5 year: 1998 ident: 10.1016/j.ejor.2023.03.013_bib0034 article-title: Quantum annealing in the transverse ising model publication-title: Physical Review E doi: 10.1103/PhysRevE.58.5355 – volume: 64 start-page: 156 issue: 2 year: 1993 ident: 10.1016/j.ejor.2023.03.013_bib0013 article-title: A new lower bound for the job shop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90174-L – volume: 43 start-page: 601 issue: 9 year: 1927 ident: 10.1016/j.ejor.2023.03.013_bib0042 article-title: Zur quantenmechanik des magnetischen elektrons publication-title: Zeitschrift für Physik A Hadrons and Nuclei – volume: 2 start-page: 79 year: 2018 ident: 10.1016/j.ejor.2023.03.013_bib0045 article-title: Quantum computing in the NISQ era and beyond publication-title: Quantum doi: 10.22331/q-2018-08-06-79 – volume: 24 start-page: 1 issue: 1 year: 1985 ident: 10.1016/j.ejor.2023.03.013_bib0019 article-title: Quantum theory as a universal physical theory publication-title: International Journal of Theoretical Physics doi: 10.1007/BF00670071 – start-page: 56 year: 2020 ident: 10.1016/j.ejor.2023.03.013_bib0051 article-title: Quantum optimization for the graph coloring problem with space-efficient embedding publication-title: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) doi: 10.1109/QCE49297.2020.00018 – volume: 138 start-page: 21 year: 2005 ident: 10.1016/j.ejor.2023.03.013_bib0003 article-title: Schedule generation schemes for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis publication-title: Annals of Operations Research doi: 10.1007/s10479-005-2443-4 – volume: 21 start-page: 467 issue: 6 year: 1982 ident: 10.1016/j.ejor.2023.03.013_bib0025 article-title: Simulating physics with computers publication-title: International Journal of Theoretical Physics doi: 10.1007/BF02650179 – ident: 10.1016/j.ejor.2023.03.013_bib0046 – volume: 26 start-page: 1411 issue: 5 year: 1997 ident: 10.1016/j.ejor.2023.03.013_bib0007 article-title: Quantum complexity theory publication-title: SIAM Journal on Computing doi: 10.1137/S0097539796300921 – volume: 2 start-page: 010101 issue: 1 year: 2021 ident: 10.1016/j.ejor.2023.03.013_bib0039 article-title: From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms publication-title: PRX Quantum doi: 10.1103/PRXQuantum.2.010101 – volume: 7 start-page: 015006 year: 2013 ident: 10.1016/j.ejor.2023.03.013_bib0032 article-title: An integrated programming and development environment for adiabatic quantum optimization publication-title: Computational Science & Discovery doi: 10.1088/1749-4680/7/1/015006 – volume: 2 start-page: 1 issue: 4 year: 2021 ident: 10.1016/j.ejor.2023.03.013_bib0028 article-title: On the representation of boolean and real functions as hamiltonians for quantum computing publication-title: ACM Transactions on Quantum Computing doi: 10.1145/3478519 – ident: 10.1016/j.ejor.2023.03.013_bib0041 doi: 10.1119/1.1463744 – volume: 34 start-page: 391 issue: 3 year: 1988 ident: 10.1016/j.ejor.2023.03.013_bib0001 article-title: The shifting bottleneck procedure for job shop scheduling publication-title: Management Science doi: 10.1287/mnsc.34.3.391 – volume: 2 start-page: 5 year: 2014 ident: 10.1016/j.ejor.2023.03.013_sbref0036 article-title: Ising formulations of many NP problems publication-title: Frontiers in Physics doi: 10.3389/fphy.2014.00005 – start-page: 1 year: 2022 ident: 10.1016/j.ejor.2023.03.013_bib0035 article-title: An investigation of ibm quantum computing device performance on combinatorial optimisation problems publication-title: Neural Computing and Applications – volume: 35 start-page: 282 issue: 1 year: 2008 ident: 10.1016/j.ejor.2023.03.013_bib0057 article-title: A very fast TS/SA algorithm for the job shop scheduling problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.02.024 – volume: 59 start-page: 240 issue: 2 year: 1999 ident: 10.1016/j.ejor.2023.03.013_bib0026 article-title: Complexity limitations on quantum computation publication-title: Journal of Computer and System Sciences doi: 10.1006/jcss.1999.1651 – volume: 3 start-page: 033195 issue: 3 year: 2021 ident: 10.1016/j.ejor.2023.03.013_bib0047 article-title: Implementation of measurement reduction for the variational quantum eigensolver publication-title: Physical Review Research doi: 10.1103/PhysRevResearch.3.033195 – volume: 52 start-page: 1191 issue: 6 year: 1997 ident: 10.1016/j.ejor.2023.03.013_bib0036 article-title: Quantum computations: Algorithms and error correction publication-title: Russian Mathematical Surveys doi: 10.1070/RM1997v052n06ABEH002155 – year: 2016 ident: 10.1016/j.ejor.2023.03.013_bib0053 article-title: Quantum annealing implementation of job-shop scheduling publication-title: arXiv:1506.08479: Quantum Physics – start-page: 11 year: 1993 ident: 10.1016/j.ejor.2023.03.013_bib0006 article-title: Quantum complexity theory – ident: 10.1016/j.ejor.2023.03.013_bib0023 – volume: 17 start-page: 261 year: 2020 ident: 10.1016/j.ejor.2023.03.013_bib0055 article-title: Scipy 1.0: Fundamental algorithms for scientific computing in python publication-title: Nature Methods doi: 10.1038/s41592-019-0686-2 – volume: 46 start-page: 101093 year: 2020 ident: 10.1016/j.ejor.2023.03.013_sbref0016 article-title: From digital hype to analogue reality: Universal simulation beyond the quantum and exascale eras publication-title: Journal of Computational Science doi: 10.1016/j.jocs.2020.101093 – volume: 8 start-page: 302 issue: 3 year: 1996 ident: 10.1016/j.ejor.2023.03.013_bib0052 article-title: Job shop scheduling by local search publication-title: INFORMS Journal of Computing doi: 10.1287/ijoc.8.3.302 – year: 2022 ident: 10.1016/j.ejor.2023.03.013_bib0018 article-title: Limitations of variational quantum algorithms: Aquantum optimal transport approach publication-title: arXiv preprint – volume: 14 start-page: 034009 issue: 3 year: 2020 ident: 10.1016/j.ejor.2023.03.013_bib0054 article-title: Applying the quantum approximate optimization algorithm to the tail-assignment problem publication-title: Physical Review Applied doi: 10.1103/PhysRevApplied.14.034009 – start-page: 502 year: 2020 ident: 10.1016/j.ejor.2023.03.013_bib0037 article-title: Hybrid quantum annealing heuristic method for solving job shop scheduling problem – volume: 51 start-page: 283 issue: 3 year: 1991 ident: 10.1016/j.ejor.2023.03.013_bib0009 article-title: Mathematical programming formulations for machine scheduling: A survey publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(91)90304-E |
| SSID | ssj0001515 |
| Score | 2.5490966 |
| Snippet | •Demonstrate how to efficiently apply Quantum Approximate Optimization Algorithm (QAOA) to Job Shop Scheduling Problem (JSSP).•Investigation of the behaviour... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 518 |
| SubjectTerms | Computing science Heuristics Job shop scheduling problem Quantum approximate optimization algorithm Scheduling |
| Title | Application of quantum approximate optimization algorithm to job shop scheduling problem |
| URI | https://dx.doi.org/10.1016/j.ejor.2023.03.013 |
| Volume | 310 |
| WOSCitedRecordID | wos001006829600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect database customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLaqDSF44FJAbFzkB_YUBeXu5LGrhoBJE5r60LfIdmzWqktKmm5t_xZ_kOPYuTDYxB6QqqiybKfNOTnns32-cxD6kAQZy3zB7DBzpA1vYmKDExZ2EtLIlR6NZJzVxSbI2Vk8nSbfBoOfDRfmakHyPN5skuV_FTW0gbAVdfYe4m4nhQb4DkKHK4gdrv8k-FF3JK2Q4I81PDsVgaySh29mAFCFVYCduDQETIsuvhflrLq4VDB0XjBrdVEsLVj0ghMyXPW65syte_gGz0JD2ewsmhRC7VbzKfS_NhWyT8vddrWrCtlZZb7VzLSJClbaddu20E_ziSqx7trP1eH-sX80Do-Ox1uuZz2nkqoWXWOo2cfw6og4TbNs-FuE2J6nmZyNbfZNzOust0bWljY0Zls77VAzzP_wB3prYv5RzAuV_NXz64y2mv36e_LtG06xDVVsouDmqZojVXOkDnxUpeR9j4QJmNL90ZeT6dcWACiMWB9emT9kuFo6rPDmL_k7HuphnMkz9MQsTvBIK9VzNBD5ED1suBFD9LSpAYKNSxiix72Eli_QtKd8uJDYKB_uKR_uKx9ulQ9XBQblw0r5cKd82CjfSzT5dDIZf7ZN7Q6bB05S2TTKfO5KwnhIAildLinhDgX4G4aMcC6Z5zLfYXEg4iiW1FN1EzKA206UxDD2FdrLi1y8Rpgy7oGdIYBrWcAoj0nGHYDVgmXMT7g4QG7zAFNu8tqr8iqL9HbRHSCrHbPUWV3u7B02ckkNLtV4MwU1u2Pc4b3u8gY96l6Lt2ivKtfiHXrAr6rZqnxvdOwXXgy0bQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Application+of+quantum+approximate+optimization+algorithm+to+job+shop+scheduling+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Kurowski%2C+Krzysztof&rft.au=Pecyna%2C+Tomasz&rft.au=Slysz%2C+Mateusz&rft.au=R%C3%B3%C5%BCycki%2C+Rafa%C5%82&rft.date=2023-10-16&rft.issn=0377-2217&rft.volume=310&rft.issue=2&rft.spage=518&rft.epage=528&rft_id=info:doi/10.1016%2Fj.ejor.2023.03.013&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2023_03_013 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |