{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:02:43Z","timestamp":1775743363327,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031080104","type":"print"},{"value":"9783031080111","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_10","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"120-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving the\u00a0Extended Job Shop Scheduling Problem with\u00a0AGVs \u2013 Classical and\u00a0Quantum Approaches"],"prefix":"10.1007","author":[{"given":"Marc","family":"Geitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6393-1919","authenticated-orcid":false,"given":"Cristian","family":"Grozea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Steigerwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"St\u00f6hr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3940-0792","authenticated-orcid":false,"given":"Armin","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Artigues, C., Belmokhtar, S., Feillet, D.: A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times. In: R\u00e9gin, J.C., Rueher, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems First International Conference, CPAIOR 2004, Nice, France, April 20\u201322, 2004. Proceedings. Lecture Notes in Computer Science, vol. 3011, pp. 37\u201349. Springer-Verlag (2004). https:\/\/doi.org\/10.1007\/978-3-540-24664-0_3, http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.460.8724&rep=rep1&type=pdf","DOI":"10.1007\/978-3-540-24664-0_3"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C Artigues","year":"2008","unstructured":"Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann. Oper. Res. 159(1), 135\u2013159 (2008). https:\/\/doi.org\/10.1007\/s10479-007-0283-0","journal-title":"Ann. Oper. Res."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Baptiste, P., le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. No. 39 in international series in operations research & management science. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"10_CR4","unstructured":"Baptiste, P., Pape, C.L.: Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In: Proceedings 15th Workshop of the U.K. Planning Special Interest Group (1996)"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1177\/0142331208100099","volume":"32","author":"R Bart\u00e1k","year":"2010","unstructured":"Bart\u00e1k, R., \u010cepek, O.: Incremental propagation rules for a precedence graph with optional activities and time windows. Transactions of the Institute of Measurement and Control 32(1), 73\u201396 (2010). https:\/\/doi.org\/10.1177\/0142331208100099","journal-title":"Transactions of the Institute of Measurement and Control"},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69516-5","volume-title":"Scheduling Algorithms","year":"2007","unstructured":"Brucker, P. (ed.): Scheduling Algorithms. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69516-5"},{"key":"10_CR7","unstructured":"Bundesministerium f\u00fcr Wirtschaft und Energie: Plattform und \u00d6kosystem f\u00fcr Quantenunterst\u00fctzte K\u00fcnstliche Intelligenz. https:\/\/planqk.de"},{"key":"10_CR8","unstructured":"Chakraborty, S., Bhowmik, S.: Job shop scheduling using simulated annealing. In: Proceedings of the First International Conference on Computation and Communication Advancement. pp. 69\u201373. McGrawHill Publication, JIS College of Engineering, Kalyani, India, January 2013"},{"key":"10_CR9","unstructured":"D-Wave Systems Inc.: Introduction to quantum annealing. https:\/\/docs.dwavesys.com\/docs\/latest\/c_gs_2.html. Accessed 4 May 2020"},{"key":"10_CR10","unstructured":"D-Wave Systems Inc.: Job shop scheduling. https:\/\/github.com\/dwave-examples\/job-shop-scheduling. Accessed 4 May 2020"},{"key":"10_CR11","unstructured":"D-Wave Systems Inc.: Problem formulations: Ising and qubo. https:\/\/docs.dwavesys.com\/docs\/latest\/c_gs_3.html. Accessed 4 May 2020"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Feydy, T., Schutt, A., Stuckey, P.J.: Global difference constraint propagation for finite domain solvers. In: Proceedings of the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming - PPDP \u201908. p. 226. ACM Press, Valencia, Spain (2008). DOI: https:\/\/doi.org\/10.1145\/1389449.1389478","DOI":"10.1145\/1389449.1389478"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352\u2013366. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_29"},{"key":"10_CR14","unstructured":"Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: Proceedings of the AIPS-2000, p. 10. AAAI (2000)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-60299-2_33","volume-title":"Principles and Practice of Constraint Programming \u2014 CP \u201995","author":"H-J Goltz","year":"1995","unstructured":"Goltz, H.-J.: Reducing domains for search in CLP(FD) and its application to job-shop scheduling. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 549\u2013562. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60299-2_33"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Hofstedt, P., Wolf, A.: Einf\u00fchrung in die Constraint-Programmierung: Grundlagen, Methoden, Sprachen, Anwendungen. eXamen. press, Springer-Verlag, Berlin Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-68194-6","DOI":"10.1007\/978-3-540-68194-6"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Lambrecht, J., Steffens, E.J., Geitz, M., Vick, A., Funk, E., Steigerwald, W.: Cognitive edge for factory: a case study on campus networks enabling smart intralogistics. In: 2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA). pp. 1325\u20131328, September 2019. https:\/\/doi.org\/10.1109\/ETFA.2019.8869394","DOI":"10.1109\/ETFA.2019.8869394"},{"key":"10_CR18","unstructured":"Lobe, E.: L\u00f6sen von QUBO-Problemen auf einem Adiabatischen Quanten-Annealer. GOR Workshop. 19 May 2017"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-38171-3_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J.: Explaining time-table-edge-finding propagation for the cumulative resource constraint. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 234\u2013250. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38171-3_16"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Explaining the cumulative propagator. Constraints 16(3), 250\u2013282 (2011). https:\/\/doi.org\/10.1007\/s10601-010-9103-2","journal-title":"Constraints"},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10951-012-0285-x","volume":"16","author":"A Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Solving RCPSP\/max by lazy clause generation. J. Sched. 16(3), 273\u2013289 (2013). https:\/\/doi.org\/10.1007\/s10951-012-0285-x","journal-title":"J. Sched."},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-44953-1_28","volume-title":"Principles and Practice of Constraint Programming","author":"A Schutt","year":"2016","unstructured":"Schutt, A., Stuckey, P.J.: Explaining producer\/consumer constraints. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 438\u2013454. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_28"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-13520-0_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"PJ Stuckey","year":"2010","unstructured":"Stuckey, P.J.: Lazy clause generation: combining the power of SAT and CP (and MIP?) solving. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 5\u20139. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_3"},{"issue":"4","key":"10_CR24","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10951-019-00632-8","volume":"23","author":"S Van Cauwelaert","year":"2020","unstructured":"Van Cauwelaert, S., Dejemeppe, C., Schaus, P.: An efficient filtering algorithm for the unary resource constraint with transition times and optional activities. J. Sched. 23(4), 431\u2013449 (2020). https:\/\/doi.org\/10.1007\/s10951-019-00632-8","journal-title":"J. Sched."},{"key":"10_CR25","unstructured":"Venturelli, D., Marchand, D.J.J., Rojo, G.: Quantum annealing implementation of job-shop scheduling. October 2016. http:\/\/arxiv.org\/abs\/1506.08479, comment: p. 15, 6 figure, Presented at Constraint Satisfaction Techniques for Planning and Scheduling (COPLAS) Workshop of the 26th International Conference on Automated Planning and Scheduling (2016)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P.: Batch processing with sequence dependent setup times: new results. In: Proceedings of the 4th Workshop of Constraint Programming for Decision and Control, CPDC\u201902, p. 6. Gliwice, Poland (2002)","DOI":"10.1007\/3-540-46135-3_62"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-24664-0_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Vil\u00edm","year":"2004","unstructured":"Vil\u00edm, P.: O(nlogn) filtering algorithms for unary resource constraint. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 335\u2013347. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24664-0_23"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/3-540-46135-3_62","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"P Vil\u00edm","year":"2002","unstructured":"Vil\u00edm, P.: Batch processing with sequence dependent setup times. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 764\u2013764. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_62"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-30201-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Vil\u00edm","year":"2004","unstructured":"Vil\u00edm, P., Bart\u00e1k, R., \u010cepek, O.: Unary resource constraint with optional activities. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 62\u201376. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_8"},{"key":"10_CR30","volume-title":"Quantum Machine Learning: What Quantum Computing Means to Data Mining","author":"P Wittek","year":"2014","unstructured":"Wittek, P.: Quantum Machine Learning: What Quantum Computing Means to Data Mining. Elsevier, Amsterdam (2014)"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-540-45193-8_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"A Wolf","year":"2003","unstructured":"Wolf, A.: Pruning while sweeping over task intervals. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 739\u2013753. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_50"},{"key":"10_CR32","unstructured":"Wolf, A.: Constraint-based task scheduling with sequence dependent setup times, time windows and breaks. In: Fischer, S., Maehle, E., Reischuk, R. (eds.). In: Proceedings of the Informatik 2009: Im Focus Das Leben, Beitr\u00e4ge Der 39. Jahrestagung Der Gesellschaft F\u00fcr Informatik e.V. (GI), 28.9.-2.10.2009, L\u00fcbeck. Lecture Notes in Informatics (LNI) - Proceedings Series of the Gesellschaft F\u00fcr Informatik (GI), vol. 154, pp. 3205\u20133219. Gesellschaft f\u00fcr Informatik e.V. (2009)"},{"issue":"1","key":"10_CR33","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s13218-011-0161-4","volume":"26","author":"A Wolf","year":"2012","unstructured":"Wolf, A.: firstCS\u2014New Aspects on Combining Constraint Programming with Object-Orientation in Java. KI - K\u00fcnstliche Intelligenz 26(1), 55\u201360 (2012). https:\/\/doi.org\/10.1007\/s13218-011-0161-4","journal-title":"KI - K\u00fcnstliche Intelligenz"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/11415763_12","volume-title":"Applications of Declarative Programming and Knowledge Management","author":"A Wolf","year":"2005","unstructured":"Wolf, A., Schlenker, H.: Realising the alternative resources constraint. In: Seipel, D., Hanus, M., Geske, U., Bartenstein, O. (eds.) INAP\/WLP -2004. LNCS (LNAI), vol. 3392, pp. 185\u2013199. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11415763_12"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Yamada T., N.R.: Job-shop scheduling by simulated annealing combined with deterministic local search. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heuristics, pp. 237\u2013248. Springer, Boston, MA (1996). https:\/\/doi.org\/10.1007\/978-1-4613-1361-8_15","DOI":"10.1007\/978-1-4613-1361-8_15"},{"key":"10_CR36","doi-asserted-by":"publisher","DOI":"10.5772\/55956","author":"R Zhang","year":"2013","unstructured":"Zhang, R.: A simulated annealing-based heuristic algorithm for job shop scheduling to minimize lateness. International Journal of Advanced Robotic Systems (2013). https:\/\/doi.org\/10.5772\/55956","journal-title":"International Journal of Advanced Robotic Systems"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T13:03:53Z","timestamp":1667912633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","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":"60","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":"28","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":"0","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":"47% - 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":"3","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)"}}]}}