{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:18:52Z","timestamp":1743135532199,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648428"},{"type":"electronic","value":"9783030648435"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_11","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"151-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reachability Games for Optimal Multi-agent Scheduling of Tasks with Variable Durations"],"prefix":"10.1007","author":[{"given":"Dhananjay","family":"Raju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niklas","family":"Lauffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ufuk","family":"Topcu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Artigues, C., Demassey, S., Neron, E.: Resource-Constrained Project Scheduling: Models, Algorithms. Extensions and Applications, ISTE (2007)","DOI":"10.1002\/9780470611227"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-24288-5_1","volume-title":"Reachability Problems","author":"K Chatterjee","year":"2011","unstructured":"Chatterjee, K.: Graph games with reachability objectives. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, p. 1. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24288-5_1"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"T Cheng","year":"2004","unstructured":"Cheng, T., Ding, Q., Lin, B.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152(1), 1\u201313 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR4","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. IEEE, October 1991"},{"key":"11_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69446-5","volume-title":"Time-Dependent Scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S.: Time-Dependent Scheduling. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69446-5"},{"issue":"11","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1057\/jors.2010.171","volume":"62","author":"S Gawiejnowicz","year":"2011","unstructured":"Gawiejnowicz, S., Lee, W.-C., Lin, C.-L., Wu, C.-C.: Single-machine scheduling of proportionally deteriorating jobs by two agents. J. Oper. Res. Soc. 62(11), 1983\u20131991 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Geeraerts, G., Goossens, J., Nguyen, T.-V.-A.: A backward algorithm for the multiprocessor online feasibility of sporadic tasks. In: 2017 17th International Conference on Application of Concurrency to System Design (ACSD), pp. 116\u2013125, June 2017","DOI":"10.1109\/ACSD.2017.9"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.tcs.2017.06.004","volume":"735","author":"G Geeraerts","year":"2018","unstructured":"Geeraerts, G., Goossens, J., Nguyen, T.-V.-A., Stainer, A.: Synthesising succinct strategies in safety games with an application to real-time scheduling. Theor. Comput. Sci. 735, 24\u201349 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games - A Guide to Current Research","author":"E Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games - A Guide to Current Research. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"11_CR10","unstructured":"Gurobi Optimization: L. Gurobi optimizer reference manual (2020)"},{"key":"11_CR11","first-page":"14","volume":"18","author":"M Hughes","year":"1986","unstructured":"Hughes, M.: Why projects fail: the effect of ignoring the obvious. Ind. Eng. 18, 14\u201318 (1986)","journal-title":"Ind. Eng."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-60744-8_38","volume-title":"Operations Research Proceedings 1996","author":"A Kononov","year":"1997","unstructured":"Kononov, A.: Scheduling problems with linear increasing processing times. Operations Research Proceedings 1996, pp. 208\u2013212. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-60744-8_38"},{"key":"11_CR13","volume-title":"Agile and Iterative Development","author":"C Larman","year":"2004","unstructured":"Larman, C.: Agile and Iterative Development. Addison-Wesley, Boston (2004)"},{"key":"11_CR14","unstructured":"Lauffer, N.T., Topcu, U.: Human-understandable explanations of infeasibility for resource-constrained scheduling problems. In: Workshop on Explainable Planning (XAIP 2019) (2019)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-04244-7_45","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"M Lombardi","year":"2009","unstructured":"Lombardi, M., Milano, M.: A precedence constraint posting approach for the RCPSP with time lags and variable durations. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 569\u2013583. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_45"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic 65(2), 149\u2013184 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"11_CR17","first-page":"205","volume":"36","author":"G Mosheiov","year":"1998","unstructured":"Mosheiov, G.: Multi-machine scheduling with linear deterioration. INFOR: Inf. Syst. Oper. Res. 36(4), 205\u2013214 (1998)","journal-title":"INFOR: Inf. Syst. Oper. Res."},{"key":"11_CR18","unstructured":"Mostowski, A.W.: Games with Forbidden Positions. UG (1991)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-0-387-33768-5_15","volume-title":"Perspectives in Modern Project Scheduling","author":"K Neumann","year":"2006","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J.: Resource-constrained project scheduling with time windows. In: J\u00f3zefowska, J., Weglarz, J. (eds.) Perspectives in Modern Project Scheduling. ISOR, pp. 375\u2013407. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-0-387-33768-5_15"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF02022042","volume":"4","author":"FJ Radermacher","year":"1985","unstructured":"Radermacher, F.J.: Scheduling of project networks. Ann. Oper. Res. 4(1), 227\u2013252 (1985)","journal-title":"Ann. Oper. Res."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/S1571-0653(04)00449-4","volume":"13","author":"F Stork","year":"2003","unstructured":"Stork, F., Uetz, M.: Enumeration of circuits and minimal forbidden sets. Electron. Notes Discret. Math. 13, 108\u2013111 (2003)","journal-title":"Electron. Notes Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:54:10Z","timestamp":1607100850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"53% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}