{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:41:41Z","timestamp":1743014501283,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819603473"},{"type":"electronic","value":"9789819603480"}],"license":[{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0348-0_26","type":"book-chapter","created":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T18:38:22Z","timestamp":1732387102000},"page":"354-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Prescriptive Tree-Based Model for\u00a0Stochastic Parallel Machine Scheduling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9083-1868","authenticated-orcid":false,"given":"Siping","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4077-3107","authenticated-orcid":false,"given":"Debiao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8566-0870","authenticated-orcid":false,"given":"Nasimul","family":"Noman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1443-3005","authenticated-orcid":false,"given":"Kyle","family":"Harrison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8285-1903","authenticated-orcid":false,"given":"Raymond","family":"Chiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,18]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, A., He, L., an\u00a0Chou, C., Hamasha, M.M.: A prediction-optimization approach to surgery prioritization in operating room scheduling. J. Ind. Prod. Eng. 39(5), 399\u2013413 (2022)","DOI":"10.1080\/21681015.2021.2017362"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling project networks with resource constraints and time windows. Ann. Oper. Res. 16(1-4), 201\u2013240 (1988)","DOI":"10.1007\/BF02283745"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoo.2018.0005","volume":"1","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Dunn, J., Mundru, N.: Optimal prescriptive trees. INFORMS J. Optim. 1(2), 164\u2013183 (2019)","journal-title":"INFORMS J. Optim."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1287\/mnsc.2018.3253","volume":"66","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Kallus, N.: From predictive to prescriptive analytics. Manage. Sci. 66, 1025\u20131044 (2019)","journal-title":"Manage. Sci."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10898-004-5702-z","volume":"31","author":"X Cai","year":"2005","unstructured":"Cai, X., Zhou, X.: Single-machine scheduling with exponential processing times and general stochastic cost functions. J. Global Optim. 31, 317\u2013332 (2005)","journal-title":"J. Global Optim."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1287\/mnsc.2020.3922","volume":"68","author":"AN Elmachtoub","year":"2021","unstructured":"Elmachtoub, A.N., Grigas, P.: Smart predict, then optimize. Manage. Sci. 68, 9\u201326 (2021)","journal-title":"Manage. Sci."},{"key":"26_CR7","unstructured":"Elmachtoub, A.N., Lam, H., Zhang, H., Zhao, Y.: Estimate-then-optimize versus integrated-estimation-optimization versus sample average approximation: a stochastic dominance perspective. arXiv preprint arXiv:2304.06833 (2023)"},{"key":"26_CR8","unstructured":"Elmachtoub, A.N., Liang, J.C.N., McNellis, R.: Decision trees for decision-making under the predict-then-optimize framework. In: Proceedings of the 37th International Conference on Machine Learning, vol.\u00a0119, pp. 2858\u20132867. Proceedings of Machine Learning Research (2020)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Framinan, J.M., Perez-Gonzalez, P.: On heuristic solutions for the stochastic flowshop scheduling problem. Euro. J. Oper. Res. 246, 413\u2013420 (2015)","DOI":"10.1016\/j.ejor.2015.05.006"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Ghasemi, A., Ashoori, A., Heavey, C.: Evolutionary learning based simulation optimization for stochastic job shop scheduling problems. Appl. Soft Comput. 106 (2021)","DOI":"10.1016\/j.asoc.2021.107309"},{"issue":"23","key":"26_CR11","doi-asserted-by":"publisher","first-page":"7246","DOI":"10.1080\/00207543.2020.1837407","volume":"59","author":"D Li","year":"2021","unstructured":"Li, D., Chen, S., Chiong, R., Wang, L., Dhakal, S.: Predicting the printed circuit board cycle time of surface-mount-technology production lines using a symbiotic organism search-based support vector regression ensemble. Int. J. Prod. Res. 59(23), 7246\u20137265 (2021)","journal-title":"Int. J. Prod. Res."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.cie.2014.12.017","volume":"80","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Cui, W., Han, X.: Integrated production and preventive maintenance scheduling for a single machine with failure uncertainty. Comput. Ind. Eng. 80, 236\u2013244 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Mandi, J., Demirovi, E., Stuckey, P.J., Guns, T.: Smart predict-and-optimize for hard combinatorial optimization problems. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a034, pp. 1603\u20131610 (2020)","DOI":"10.1609\/aaai.v34i02.5521"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Meilanitasari, P., Shin, S.J.: A review of prediction and optimization for sequence-driven scheduling in job shop flexible manufacturing systems. Processes 9(8) (2021)","DOI":"10.3390\/pr9081391"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.ejor.2021.01.011","volume":"294","author":"P Nesbitt","year":"2021","unstructured":"Nesbitt, P., et al.: Underground mine scheduling under uncertainty. Eur. J. Oper. Res. 294(1), 340\u2013352 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Why should I trust you? Explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1135\u20131144. KDD \u201916, Association for Computing Machinery, New York, NY, USA (2016)","DOI":"10.1145\/2939672.2939778"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s11634-020-00409-4","volume":"15","author":"T Salles","year":"2021","unstructured":"Salles, T., Rocha, L., Gon\u00e7alves, M.: A bias-variance analysis of state-of-the-art random forest text classifiers. Adv. Data Anal. Classif. 15(2), 379\u2013405 (2021)","journal-title":"Adv. Data Anal. Classif."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Soroush, H.M.: Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem. Euro. J. Oper. Res. 181, 266\u2013287 (2007)","DOI":"10.1016\/j.ejor.2006.05.036"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"106349","DOI":"10.1016\/j.cor.2023.106349","volume":"159","author":"Y Yaakoubi","year":"2023","unstructured":"Yaakoubi, Y., Dimitrakopoulos, R.: Learning to schedule heuristics for the simultaneous stochastic optimization of mining complexes. Comput. Oper. Res. 159, 106349 (2023)","journal-title":"Comput. Oper. Res."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.trb.2020.09.014","volume":"142","author":"R Yan","year":"2020","unstructured":"Yan, R., Wang, S., Fagerholt, K.: A semi- smart predict then optimize (Semi-SPO) method for efficient ship inspection. Transp. Res. Part B Methodol. 142, 100\u2013125 (2020)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"2","key":"26_CR21","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1109\/TASE.2023.3246223","volume":"21","author":"N Zhang","year":"2024","unstructured":"Zhang, N., Zhang, Y., Song, S., Chen, C.L.P.: A review of robust machine scheduling. IEEE Trans. Autom. Sci. Eng. 21(2), 1323\u20131334 (2024)","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","AI 2024: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0348-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T19:04:41Z","timestamp":1732388681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0348-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,18]]},"ISBN":["9789819603473","9789819603480"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0348-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,18]]},"assertion":[{"value":"18 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2024.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}