{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T05:50:54Z","timestamp":1747893054146,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031530241"},{"type":"electronic","value":"9783031530258"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53025-8_31","type":"book-chapter","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:02:12Z","timestamp":1706731332000},"page":"450-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Predicting the\u00a0Solution Time for\u00a0Optimization Problems Using Machine Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2436-8849","authenticated-orcid":false,"given":"Shaheen","family":"Pouya","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0690-2198","authenticated-orcid":false,"given":"Oguz","family":"Toragay","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2975-6804","authenticated-orcid":false,"given":"Mehrdad","family":"Mohammadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,1]]},"reference":[{"key":"31_CR1","unstructured":"Abadi, M., et al.: Tensorflow: large-scale machine learning on heterogeneous distributed systems. arXiv preprint arXiv:1603.04467 (2016)"},{"key":"31_CR2","unstructured":"Abolghasemi, M., Abbasi, B., Babaei, T., HosseiniFard, Z.: How to effectively use machine learning models to predict the solutions for optimization problems: lessons from loss function. arXiv preprint arXiv:2105.06618 (2021)"},{"issue":"4","key":"31_CR3","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.cie.2004.05.005","volume":"46","author":"DE Akyol","year":"2004","unstructured":"Akyol, D.E.: Application of neural networks to heuristic scheduling algorithms. Comput. Ind. Eng. 46(4), 679\u2013696 (2004)","journal-title":"Comput. Ind. Eng."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"1036642","DOI":"10.3389\/fpace.2022.1036642","volume":"1","author":"N Asadi","year":"2022","unstructured":"Asadi, N., Ghoreishi, S.F.: Bayesian state estimation in partially-observed dynamic multidisciplinary systems. Front. Aeros. Eng. 1, 1036642 (2022)","journal-title":"Front. Aeros. Eng."},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR6","unstructured":"Buitinck, L., et al.: Api design for machine learning software: experiences from the scikit-learn project. arXiv preprint arXiv:1309.0238 (2013)"},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Chien, J.T.: Chapter 7 - deep neural network. In: Chien, J.T. (ed.) Source Separation and Machine Learning, pp. 259\u2013320. Academic Press (2019). https:\/\/doi.org\/10.1016\/B978-0-12-804566-4.00019-X. https:\/\/www.sciencedirect.com\/science\/article\/pii\/B978012804566400019X","DOI":"10.1016\/B978-0-12-804566-4.00019-X"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.neucom.2015.12.114","volume":"192","author":"A De Myttenaere","year":"2016","unstructured":"De Myttenaere, A., Golden, B., Le Grand, B., Rossi, F.: Mean absolute percentage error for regression models. Neurocomputing 192, 38\u201348 (2016)","journal-title":"Neurocomputing"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-021-00516-9","volume":"8","author":"T Emmanuel","year":"2021","unstructured":"Emmanuel, T., Maupong, T., Mpoeleng, D., Semong, T., Mphago, B., Tabona, O.: A survey on missing data in machine learning. J. Big Data 8(1), 1\u201337 (2021)","journal-title":"J. Big Data"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"31_CR11","first-page":"1","volume":"32","author":"M Gasse","year":"2019","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. Adv. Neural Inf. Process. Syst. 32, 1\u201313 (2019)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10479-007-0229-6","volume":"156","author":"H Guo","year":"2007","unstructured":"Guo, H., Hsu, W.H.: A machine learning approach to algorithm selection for np-hard optimization problems: a case study on the MPE problem. Ann. Oper. Res. 156(1), 61 (2007)","journal-title":"Ann. Oper. Res."},{"key":"31_CR13","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2021)"},{"issue":"2","key":"31_CR14","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1287\/ijoc.2021.1103","volume":"34","author":"G Hendel","year":"2022","unstructured":"Hendel, G., Anderson, D., Le Bodic, P., Pfetsch, M.E.: Estimating the size of branch-and-bound trees. INFORMS J. Comput. 34(2), 934\u2013952 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1007\/s11227-020-03379-8","volume":"77","author":"H Hoorfar","year":"2021","unstructured":"Hoorfar, H., Bagheri, A.: Np-completeness of chromatic orthogonal art gallery problem. J. Supercomput. 77(3), 3077\u20133109 (2021)","journal-title":"J. Supercomput."},{"issue":"5","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1080\/002075498193309","volume":"36","author":"AS Jain","year":"1998","unstructured":"Jain, A.S., Meeran, S.: Job-shop scheduling using neural networks. Int. J. Prod. Res. 36(5), 1249\u20131272 (1998)","journal-title":"Int. J. Prod. Res."},{"key":"31_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110271","volume":"140","author":"MR Jiang","year":"2023","unstructured":"Jiang, M.R., Feng, X.F., Wang, C.P., Zhang, H., et al.: Robust color image watermarking algorithm based on synchronization correction with multi-layer perceptron and cauchy distribution model. Appl. Soft Comput. 140, 110271 (2023)","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"31_CR18","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1080\/00207543.2019.1581954","volume":"57","author":"S Jun","year":"2019","unstructured":"Jun, S., Lee, S., Chun, H.: Learning dispatching rules using random forest in flexible job shop scheduling problems. Int. J. Prod. Res. 57(10), 3290\u20133310 (2019)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"31_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A.M., Talbi, E.G.: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur. J. Oper. Res. 296(2), 393\u2013422 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR20","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. Adv. Neural Inf. Process. Syst. 30 (2017)"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30 (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"31866","DOI":"10.1109\/ACCESS.2023.3262138","volume":"11","author":"D Kreuzberger","year":"2023","unstructured":"Kreuzberger, D., K\u00fchl, N., Hirschl, S.: Machine learning operations (mlops): overview, definition, and architecture. IEEE Access 11, 31866\u201331879 (2023)","journal-title":"IEEE Access"},{"issue":"1","key":"31_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1287\/ijoc.2021.1091","volume":"34","author":"E Larsen","year":"2022","unstructured":"Larsen, E., Lachapelle, S., Bengio, Y., Frejinger, E., Lacoste-Julien, S., Lodi, A.: Predicting tactical solutions to operational planning problems under imperfect information. INFORMS J. Comput. 34(1), 227\u2013242 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"31_CR24","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25, 207\u2013236 (2017)","journal-title":"TOP"},{"issue":"1","key":"31_CR26","doi-asserted-by":"publisher","first-page":"2032925","DOI":"10.1080\/08839514.2022.2032925","volume":"36","author":"C Marcelino","year":"2022","unstructured":"Marcelino, C., Leite, G., Celes, P., Pedreira, C.: Missing data analysis in regression. Appl. Artif. Intell. 36(1), 2032925 (2022)","journal-title":"Appl. Artif. Intell."},{"key":"31_CR27","unstructured":"Mohabbati-Kalejahi, N., Yoon, S.W.: Parallel machines scheduling problem for minimization of maximum lateness with sequence-dependent setup times. In: IIE Annual Conference, Proceedings, pp. 837. Institute of Industrial and Systems Engineers (IISE) (2015)"},{"key":"31_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.enbuild.2023.113036","volume":"289","author":"A Morteza","year":"2023","unstructured":"Morteza, A., Yahyaeian, A.A., Mirzaeibonehkhater, M., Sadeghi, S., Mohaimeni, A., Taheri, S.: Deep learning hyperparameter optimization: application to electricity and heat demand prediction for buildings. Energy Build. 289, 113036 (2023)","journal-title":"Energy Build."},{"key":"31_CR29","doi-asserted-by":"crossref","unstructured":"Largani, S.M., Lee, S.: Efficient sampling for big provenance. In: Companion Proceedings of the ACM Web Conference 2023, pp. 1508\u20131511 (2023)","DOI":"10.1145\/3543873.3587556"},{"issue":"2","key":"31_CR30","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1080\/00207549208942903","volume":"30","author":"S Nakasuka","year":"1992","unstructured":"Nakasuka, S., Yoshida, T.: Dynamic scheduling system utilizing machine learning as a knowledge acquisition tool. Int. J. Prod. Res. 30(2), 411\u2013431 (1992)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"31_CR31","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1287\/ijoc.1100.0405","volume":"23","author":"OY \u00d6zalt\u0131n","year":"2011","unstructured":"\u00d6zalt\u0131n, O.Y., Hunsaker, B., Schaefer, A.J.: Predicting the solution time of branch-and-bound algorithms for mixed-integer programs. INFORMS J. Comput. 23(3), 392\u2013403 (2011)","journal-title":"INFORMS J. Comput."},{"key":"31_CR32","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)"},{"issue":"1","key":"31_CR33","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/S0377-2217(02)00173-X","volume":"145","author":"WH Raaymakers","year":"2003","unstructured":"Raaymakers, W.H., Weijters, A.: Makespan estimation in batch process industries: a comparison between regression analysis and neural networks. Eur. J. Oper. Res. 145(1), 14\u201330 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR34","unstructured":"Raschka, S., Liu, Y.H., Mirjalili, V., Dzhulgakov, D.: Machine Learning with PyTorch and Scikit-Learn: Develop Machine Learning and Deep Learning Models with Python. Packt Publishing Ltd. (2022)"},{"issue":"2","key":"31_CR35","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0377-2217(96)00041-0","volume":"93","author":"I Sabuncuoglu","year":"1996","unstructured":"Sabuncuoglu, I., Gurgun, B.: A neural network model for scheduling problems. Eur. J. Oper. Res. 93(2), 288\u2013299 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"31_CR36","first-page":"1579","volume":"7","author":"O Tora\u011fay","year":"2023","unstructured":"Tora\u011fay, O., Pouya, S.: A monte carlo simulation approach to the gap-time relationship in solving scheduling problem. J. Turk. Oper. Manag. 7(1), 1579\u20131590 (2023)","journal-title":"J. Turk. Oper. Manag."},{"issue":"10","key":"31_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ifacol.2022.09.305","volume":"55","author":"D Tremblet","year":"2022","unstructured":"Tremblet, D., Thevenin, S., Dolgui, A.: Predicting makespan in flexible job shop scheduling problem using machine learning. IFAC-PapersOnLine 55(10), 1\u20136 (2022)","journal-title":"IFAC-PapersOnLine"},{"key":"31_CR38","doi-asserted-by":"crossref","unstructured":"Wang, T., Payberah, A.H., Vlassov, V.: Convjssp: convolutional learning for job-shop scheduling problems. In: 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA), pp. 1483\u20131490. IEEE (2020)","DOI":"10.1109\/ICMLA51294.2020.00229"},{"key":"31_CR39","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.neucom.2022.11.024","volume":"519","author":"J Zhang","year":"2023","unstructured":"Zhang, J., et al.: A survey for solving mixed integer programming via machine learning. Neurocomputing 519, 205\u2013217 (2023)","journal-title":"Neurocomputing"}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53025-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T18:37:31Z","timestamp":1731177451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53025-8_31"}},"subtitle":["Case of Job Shop Scheduling Problem"],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031530241","9783031530258"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53025-8_31","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ponta Delgada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","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":"ol2a2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ol2a.ipb.pt\/","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":"162","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":"66","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":"41% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}