{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T17:51:21Z","timestamp":1771609881090,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030504328","type":"print"},{"value":"9783030504335","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50433-5_40","type":"book-chapter","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T19:03:44Z","timestamp":1592593424000},"page":"516-530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Foundations for Workflow Application Scheduling on D-Wave System"],"prefix":"10.1007","author":[{"given":"Dawid","family":"Tomasiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Pawlik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Malawski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katarzyna","family":"Rycerz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"issue":"6","key":"40_CR1","doi-asserted-by":"publisher","first-page":"061102","DOI":"10.1103\/PhysRevLett.116.061102","volume":"116","author":"BP Abbott","year":"2016","unstructured":"Abbott, B.P., Abbott, R., Abbott, T., et al.: Observation of gravitational waves from a binary black hole merger. Phys. Rev. Lett. 116(6), 061102 (2016)","journal-title":"Phys. Rev. Lett."},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.future.2015.07.021","volume":"55","author":"H Arabnejad","year":"2016","unstructured":"Arabnejad, H., Barbosa, J.G., Prodan, R.: Low-time complexity budget-deadline constrained workflow scheduling on heterogeneous resources. Future Gener. Comput. Syst. 55, 29\u201340 (2016)","journal-title":"Future Gener. Comput. Syst."},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-981-10-5026-8_1","volume-title":"Research Advances in Cloud Computing","author":"I Baldini","year":"2017","unstructured":"Baldini, I., et al.: Serverless computing: current trends and open problems. In: Chaudhary, S., Somani, G., Buyya, R. (eds.) Research Advances in Cloud Computing, pp. 1\u201320. Springer, Singapore (2017). https:\/\/doi.org\/10.1007\/978-981-10-5026-8_1"},{"key":"40_CR4","unstructured":"Berriman, G., Good, J., Laity, A., et al.: Montage: a grid enabled image mosaic service for the national virtual observatory. In: Astronomical Data Analysis Software and Systems (ADASS) XIII. vol. 314, p. 593 (2004)"},{"key":"40_CR5","unstructured":"Bian, Z., Chudak, F., Macready, W.G., Rose, G.: The Ising model: teaching an old problem new tricks. D-Wave Syst. 2 (2010). https:\/\/www.dwavesys.com\/resources\/publications?type=internal#publication-230"},{"key":"40_CR6","unstructured":"Cai, J., Macready, W.G., Roy, A.: A practical heuristic for finding graph minors. arXiv preprint arXiv:1406.2741 (2014)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Chancellor, N.: Domain wall encoding of discrete variables for quantum annealing and QAOA. Quantum Sci. Technol. 4(4), 045004 (2019). https:\/\/iopscience.iop.org\/article\/10.1088\/2058-9565\/ab33c2","DOI":"10.1088\/2058-9565\/ab33c2"},{"issue":"3","key":"40_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s11265-018-1357-8","volume":"91","author":"G Chapuis","year":"2019","unstructured":"Chapuis, G., Djidjev, H., Hahn, G., Rizk, G.: Finding maximum cliques on the D-Wave quantum annealer. J. Signal Process. Syst. 91(3), 363\u2013377 (2019)","journal-title":"J. Signal Process. Syst."},{"key":"40_CR9","volume-title":"Computer and Job-Shop Scheduling Theory","author":"EG Coffman","year":"1976","unstructured":"Coffman, E.G., Bruno, J.L.: Computer and Job-Shop Scheduling Theory. Wiley, New York (1976)"},{"key":"40_CR10","unstructured":"D-Wave Systems: D-Wave Initiates Open Quantum Software Environment (2017). https:\/\/www.dwavesys.com\/press-releases\/d-wave-initiates-open-quantum-software-environment"},{"key":"40_CR11","unstructured":"D-Wave Systems Inc.: D\u2019wave problem solving handbook. https:\/\/docs.dwavesys.com\/docs\/latest\/_downloads\/09-1171A-A_Developer_Guide_Problem_Solving_Handbook.pdf"},{"key":"40_CR12","unstructured":"Dattani, N., Szalay, S., Chancellor, N.: Pegasus: the second connectivity graph for large-scale quantum annealing hardware. arXiv preprint arXiv:1901.07636 (2019)"},{"issue":"5","key":"40_CR13","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.future.2008.06.012","volume":"25","author":"E Deelman","year":"2009","unstructured":"Deelman, E., Gannon, D., Shields, M., Taylor, I.: Workflows and e-science: an overview of workflow system features and capabilities. Future Gener. Comput. Syst. 25(5), 528\u2013540 (2009)","journal-title":"Future Gener. Comput. Syst."},{"key":"40_CR14","unstructured":"Glover, F., Kochenberger, G., Du, Y.: A Tutorial on Formulating and Using QUBO Models. arXiv preprint arXiv:1811.11538 (2018)"},{"issue":"9","key":"40_CR15","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. ell Syst. Tech. J. 45(9), 1563\u20131581 (1966). https:\/\/doi.org\/10.1002\/j.1538-7305.1966.tb01709.x","journal-title":"ell Syst. Tech. J."},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"40_CR17","unstructured":"Ja\u0142owiecki, K., Wi\u0119ckowski, A., Gawron, P., Gardas, B.: Parallel in time dynamics with quantum annealers. arXiv preprint arXiv:1909.0429"},{"key":"40_CR18","unstructured":"Jordan, S.: Quantum algorithms zoo web page. https:\/\/quantumalgorithmzoo.org\/"},{"key":"40_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility Among Combinatorial Problems","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"40_CR20","doi-asserted-by":"publisher","unstructured":"Kijak, J., Martyna, P., Pawlik, M., Balis, B., Malawski, M.: Challenges for scheduling scientific workflows on cloud functions. In: 11th IEEE International Conference on Cloud Computing, CLOUD 2018, San Francisco, CA, USA, 2\u20137 July 2018, pp. 460\u2013467. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/CLOUD.2018.00065","DOI":"10.1109\/CLOUD.2018.00065"},{"issue":"2","key":"40_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/net.21751","volume":"70","author":"M Lewis","year":"2017","unstructured":"Lewis, M., Glover, F.: Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis. Networks 70(2), 79\u201397 (2017)","journal-title":"Networks"},{"key":"40_CR22","doi-asserted-by":"publisher","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 5 (2014). https:\/\/doi.org\/10.3389\/fphy.2014.00005. https:\/\/www.frontiersin.org\/article\/10.3389\/fphy.2014.00005","DOI":"10.3389\/fphy.2014.00005"},{"issue":"3","key":"40_CR23","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/1084805.1084811","volume":"34","author":"P Maechling","year":"2005","unstructured":"Maechling, P., Chalupsky, H., Dougherty, M., et al.: Simplifying construction of complex workflows for non-expert users of the southern california earthquake center community modeling environment. ACM SIGMOD Rec. 34(3), 24\u201330 (2005)","journal-title":"ACM SIGMOD Rec."},{"key":"40_CR24","unstructured":"Pawlik, M., Figiela, K., Malawski, M.: Performance considerations on execution of large scale workflow applications on cloud functions. arXiv preprint arXiv:1909.03555 (2019)"},{"key":"40_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-14082-3_11","volume-title":"Quantum Technology and Optimization Problems","author":"E Pelofske","year":"2019","unstructured":"Pelofske, E., Hahn, G., Djidjev, H.: Solving large maximum clique problems on a quantum annealer. In: Feld, S., Linnhoff-Popien, C. (eds.) QTOP 2019. LNCS, vol. 11413, pp. 123\u2013135. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14082-3_11"},{"key":"40_CR26","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)"},{"key":"40_CR27","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-319-73353-1_11","volume-title":"High Performance Computing","author":"J Spillner","year":"2018","unstructured":"Spillner, J., Mateos, C., Monge, D.A.: FaaSter, better, cheaper: the prospect of serverless scientific computing and HPC. In: Mocskos, E., Nesmachnow, S. (eds.) CARLA 2017. CCIS, vol. 796, pp. 154\u2013168. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73353-1_11"},{"issue":"5","key":"40_CR28","first-page":"8","volume":"53","author":"S Tsukamoto","year":"2017","unstructured":"Tsukamoto, S., Takatsu, M., Matsubara, S., Tamura, H.: An accelerator architecture for combinatorial optimization problems. Fujitsu Sci. Tech. J. 53(5), 8\u201313 (2017)","journal-title":"Fujitsu Sci. Tech. J."},{"key":"40_CR29","unstructured":"Venturelli, D., Marchand, D.J.J., Rojo, G.: Quantum annealing implementation of job-shop scheduling. arXiv:1506.08479 (2015)"},{"issue":"1","key":"40_CR30","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/TCC.2015.2404807","volume":"4","author":"AC Zhou","year":"2015","unstructured":"Zhou, A.C., He, B., Liu, C.: Monetary cost optimizations for hosting workflow-as-a-service in IaaS clouds. IEEE Trans. Cloud Comput. 4(1), 34\u201348 (2015)","journal-title":"IEEE Trans. Cloud Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50433-5_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T23:10:53Z","timestamp":1718752253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50433-5_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030504328","9783030504335"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50433-5_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"248 workshop papers were selected from 489 submissions to the thematic tracks. The conference was canceled due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}