{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:32:22Z","timestamp":1743057142746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319729251"},{"type":"electronic","value":"9783319729268"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-319-72926-8_42","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T17:42:36Z","timestamp":1513791756000},"page":"506-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Horn","sequence":"first","affiliation":[]},{"given":"G\u00fcnther","family":"Raidl","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.ejor.2016.05.036","volume":"255","author":"A Allahverdi","year":"2016","unstructured":"Allahverdi, A.: A survey of scheduling problems with no-wait in process. Eur. J. Oper. Res. 255(3), 665\u2013686 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"42_CR2","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"},{"key":"42_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)"},{"issue":"5","key":"42_CR4","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"PC Gilmore","year":"1964","unstructured":"Gilmore, P.C., Gomory, R.E.: Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Oper. Res. 12(5), 655\u2013679 (1964)","journal-title":"Oper. Res."},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207(1), 1\u201314 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR7","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, Coventry (2006)"},{"key":"42_CR8","unstructured":"Maschler, J., Riedler, M., Stock, M., Raidl, G.R.: Particle therapy patient scheduling: first heuristic approaches. In: PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling, Udine, Italy, pp. 223\u2013244 (2016)"},{"issue":"2","key":"42_CR9","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/62.65","volume":"31","author":"H R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H.: The three-machine no-wait flow shop is NP-complete. J. ACM 31(2), 336\u2013345 (1984)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"42_CR10","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","Machine Learning, Optimization, and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72926-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:09:14Z","timestamp":1710324554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-72926-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319729251","9783319729268"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72926-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Machine Learning, Optimization, and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Volterra","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.taosciences.it\/mod\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}