{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:01:02Z","timestamp":1743073262208,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"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-58115-2_27","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"385-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Kaufmann","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Horn","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10288-007-0050-8","volume":"6","author":"D Conforti","year":"2008","unstructured":"Conforti, D., Guerriero, F., Guido, R.: Optimization models for radiotherapy patient scheduling. 4OR 6(3), 263\u2013278 (2008)","journal-title":"4OR"},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2016","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2016). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Optim."},{"key":"27_CR4","unstructured":"Horn, M., Maschler, J., Raidl, G., R\u00f6nnberg, E.: A*-based construction of decision diagrams for a prize-collecting scheduling problem. Technical report AC-TR-18-011, Algorithms and Complexity Group, TU Wien (2018)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Horn, M., Raidl, G., Blum, C.: Job sequencing with one common and multiple secondary resources: an A*\/Beam Search based anytime algorithm. Artif. Intell. 277(103173) (2019)","DOI":"10.1016\/j.artint.2019.103173"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Horn, M., Raidl, G., R\u00f6nnberg, E.: A* search for prize-collecting job sequencing with one common and multiple secondary resources. Ann. Oper. Res. (2020)","DOI":"10.1007\/s10479-020-03550-7"},{"key":"27_CR7","unstructured":"Horn, M., Raidl, G.R., R\u00f6nnberg, E.: An A$$^*$$ algorithm for solving a prize-collecting sequencing problem with one common and multiple secondary resources and time windows. In: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, PATAT 2018, pp. 235\u2013256 (2018)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-319-72926-8_42","volume-title":"Machine Learning, Optimization, and Big Data","author":"M Horn","year":"2018","unstructured":"Horn, M., Raidl, G., Blum, C.: Job sequencing with one common and multiple secondary resources: a problem motivated from particle therapy for cancer treatment. In: Nicosia, G., Pardalos, P., Giuffrida, G., Umeton, R. (eds.) MOD 2017. LNCS, vol. 10710, pp. 506\u2013518. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72926-8_42"},{"key":"27_CR9","unstructured":"Kapamara, T., Sheibani, K., Haas, O., Petrovic, D., Reeves, C.: A review of scheduling problems in radiotherapy. In: Proceedings of the International Control Systems Engineering Conference, pp. 207\u2013211. Coventry University Publishing (2006)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Kaufmann, T.: A variable neighborhood search for the job sequencing with one common and multiple secondary resources problem. Master\u2019s thesis, TU Wien, Vienna, Austria (2019)","DOI":"10.1007\/978-3-030-58115-2_27"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u0144ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u0144ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"27_CR12","unstructured":"Maschler, J., Raidl, G.R.: Multivalued decision diagrams for a prize-collecting sequencing problem. In: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, PATAT 2018, pp. 375\u2013397 (2018)"},{"key":"27_CR13","unstructured":"Maschler, J., Riedler, M., Stock, M., Raidl, G.R.: Particle therapy patient scheduling: first heuristic approaches. In: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling, PATAT 2016, pp. 223\u2013244 (2016)"},{"issue":"11","key":"27_CR14","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"27_CR15","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T Schiavinotto","year":"2007","unstructured":"Schiavinotto, T., St\u00fctzle, T.: A review of metrics on permutations for search landscape analysis. Comput. Oper. Res. 34(10), 3143\u20133153 (2007). https:\/\/doi.org\/10.1016\/j.cor.2005.11.022","journal-title":"Comput. Oper. Res."},{"issue":"1\u20132","key":"27_CR16","first-page":"235","volume":"82","author":"JAA Van der Veen","year":"1998","unstructured":"Van der Veen, J.A.A., W\u00f6ginger, G.J., Zhang, S.: Sequencing jobs that require common resources on a single machine: a solvable case of the TSP. Math. Program. 82(1\u20132), 235\u2013254 (1998)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T12:38:53Z","timestamp":1617107933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_27","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":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","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":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","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":"268","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":"99","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":"37% - 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":"2.2","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)"}}]}}