{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:11:09Z","timestamp":1743127869359,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030823962"},{"type":"electronic","value":"9783030823979"}],"license":[{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-82397-9_5","type":"book-chapter","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T06:02:31Z","timestamp":1639461751000},"page":"103-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Single-Machine Scheduling via Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Yuanyuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edoardo","family":"Fadda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Manerba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mina","family":"Roohnavazfar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tadei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Terzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,15]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.3934\/jimo.2014.10.219","volume":"10","author":"MO Adamu","year":"2014","unstructured":"Adamu, M.O., Adewumi, A.: A survey of single machine scheduling to minimize weighted number of tardy jobs. J. Ind. Manag. Optim. 10, 219\u2013241 (2014)","journal-title":"J. Ind. Manag. Optim."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Behnamiana, J., Ghomi, S.F., Zandieh, M.: A multi-phase covering pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst. Appl. 36, 11057\u201311069 (2009)","DOI":"10.1016\/j.eswa.2009.02.080"},{"key":"5_CR3","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2010","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer Publishing Company, Incorporated (2010)","edition":"5"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"58377","DOI":"10.1109\/ACCESS.2020.2982218","volume":"8","author":"P Castrogiovanni","year":"2020","unstructured":"Castrogiovanni, P., Fadda, E., Perboli, G., Rizzo, A.: Smartphone data classification technique for detecting the usage of public or private transportation modes. IEEE Access 8, 58377\u201358391 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2982218","journal-title":"IEEE Access"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Cerone, V., Fadda, E., Regruto, D.: A robust optimization approach to kernel-based nonparametric error-in-variables identification in the presence of bounded noise. In: 2017 American Control Conference (ACC), IEEE (2017). https:\/\/doi.org\/10.23919\/ACC.2017.7963056","DOI":"10.23919\/ACC.2017.7963056"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10107-007-0204-7","volume":"119","author":"JR Correa","year":"2009","unstructured":"Correa, J.R., Wagner, M.R.: Lp-based online scheduling: from single to parallel machines. Math. Program. 119(1), 109\u2013136 (2009)","journal-title":"Math. Program."},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Fadda, E., Plebani, P., Vitali, M.: Optimizing monitorability of multi-cloud applications. In: Nurcan, S., Soffer, P., Bajec, M., Eder, J. (eds.) Advanced Information Systems Engineering. CAiSE 2016. Lecture Notes in Computer Science, vol. 9694, pp. 411\u2013426. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39696-5_25","DOI":"10.1007\/978-3-319-39696-5_25"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Fadda, E., Perboli, G., Squillero, G.: Adaptive batteries exploiting on-line steady-state evolution strategy. In: Squillero, G., Sim, K. (eds.) Applications of Evolutionary Computation. EvoApplications 2017. Lecture Notes in Computer Science, vol. 10199, pp. 329\u2013341. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55849-3_22","DOI":"10.1007\/978-3-319-55849-3_22"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Fadda, E., Manerba, D., Tadei, R., Camurati, P., Cabodi, G.: KPIs for optimal location of charging stations for electric vehicles: the Biella case-study. In: Ganzha, M., Maciaszek, L., Paprzycki, M. (eds.) Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, IEEE, Annals of Computer Science and Information Systems, vol.\u00a018, pp. 123\u2013126 (2019). https:\/\/doi.org\/10.15439\/2019F171","DOI":"10.15439\/2019F171"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Fadda, E., Manerba, D., Cabodi, G., Camurati, P., Tadei, R.: Evaluation of Optimal Charging Station Location for Electric Vehicles: An Italian Case-Study, pp. 71\u201387 (2021). https:\/\/doi.org\/10.1007\/978-3-030-58884-7_4","DOI":"10.1007\/978-3-030-58884-7_4"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Fadda, E., Manerba, D., Cabodi, G., Camurati, P.E., Tadei, R.: Comparative analysis of models and performance indicators for optimal service facility location. Transp. Res. Part E: Logist. Transp. Rev. 145 (2021)","DOI":"10.1016\/j.tre.2020.102174"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.cor.2016.05.006","volume":"75","author":"V Fernandez-Viagas","year":"2016","unstructured":"Fernandez-Viagas, V., Dios, M., Framinan, J.M.: Ecient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness. Comput. Oper. Res. 75, 38\u201348 (2016)","journal-title":"Comput. Oper. Res."},{"key":"5_CR13","unstructured":"Fran\u00e7ois-Lavet, V., Fonteneau, R., Ernst, D.: How to discount deep reinforcement learning: towards new dynamic strategies (2015). arXiv:151202011"},{"issue":"4","key":"5_CR14","first-page":"14","volume":"24","author":"T Gabel","year":"2008","unstructured":"Gabel, T., Riedmiller, M.: Adaptive reactive job-shop scheduling with reinforcement learning agents. Int. J. Inf. Technol. Intell. Comput. 24(4), 14\u201318 (2008)","journal-title":"Int. J. Inf. Technol. Intell. Comput."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.3390\/su11041083","volume":"11","author":"R Giusti","year":"2019","unstructured":"Giusti, R., Iorfida, C., Li, Y., Manerba, D., Musso, S., Perboli, G., Tadei, R., Yuan, S.: Sustainable and de-stressed international supply-chains through the synchro-net approach. Sustainability 11, 1083 (2019). https:\/\/doi.org\/10.3390\/su11041083","journal-title":"Sustainability"},{"issue":"9","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966). https:\/\/doi.org\/10.1002\/j.1538-7305.1966.tb01709.x","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1287\/opre.29.4.646","volume":"29","author":"SC Graves","year":"1981","unstructured":"Graves, S.C.: A review of production scheduling. Oper. Res. 29(4), 646\u2013675 (1981). https:\/\/doi.org\/10.1287\/opre.29.4.646","journal-title":"Oper. Res."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.2507\/IJSIMM11(3)2.201","volume":"11","author":"A Kaban","year":"2012","unstructured":"Kaban, A., Othman, Z., Rohmah, D.: Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study. Int. J. Simul. Model. 11(3), 129\u2013140 (2012). https:\/\/doi.org\/10.2507\/IJSIMM11(3)2.201","journal-title":"Int. J. Simul. Model."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1002\/nav.3800280411","volume":"28","author":"J Kanet","year":"1981","unstructured":"Kanet, J.: Minimizing the average deviation of job completion times about a common due date. Nav. Res. Logist. Q. 28, 643\u2013651 (1981)","journal-title":"Nav. Res. Logist. Q."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.04.007","volume":"202","author":"C Koulamas","year":"2010","unstructured":"Koulamas, C.: The single-machine total tardiness scheduling problem: review and extensions. Eur. J. Oper. Res. 202, 1\u20137 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Leksakul, K., Techanitisawad, A.: An application of the neural network energy function to machine sequencing. Comput. Manag. Sci. 2, 309\u2013338 (2005)","DOI":"10.1007\/s10287-005-0037-x"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Li, Y., Carabelli, S., Fadda, E., Manerba, D., Tadei, R., Terzo, O.: Machine learning and optimization for production rescheduling in industry 4.0. In: The International Journal of Advanced Manufacturing Technology, pp. 1\u201319 (2020). https:\/\/doi.org\/10.1007\/s00170-020-05850-5","DOI":"10.1007\/s00170-020-05850-5"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S0167-6377(03)00016-6","volume":"31","author":"X Lu","year":"2003","unstructured":"Lu, X., Sitters, R., Stougie, L.: A class of on-line scheduling algorithms to minimize total completion time. Oper. Res. Lett. 31(3), 232\u2013236 (2003). https:\/\/doi.org\/10.1016\/S0167-6377(03)00016-6","journal-title":"Oper. Res. Lett."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2019.10.037","volume":"283","author":"NM Marco Silve","year":"2020","unstructured":"Marco Silve, N.M., Poss, Michael: Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty. Eur. J. Oper. Res. 283, 70\u201382 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR25","unstructured":"Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., Riedmiller, M.: Playing atari with deep reinforcement learning (2013). arXiv:13125602"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ejor.2015.07.001","volume":"248","author":"G Oliver Herr","year":"2016","unstructured":"Oliver Herr, G.: Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints. Eur. J. Oper. Res. 248, 123\u2013135 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalkar","year":"1977","unstructured":"Panwalkar, S.S., Iskander, W.: A survey of scheduling rules. Oper. Res. 25(1), 45\u201361 (1977). https:\/\/doi.org\/10.1287\/opre.25.1.45","journal-title":"Oper. Res."},{"key":"5_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Springer, New York, NY, USA (2012)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Rice, J.R.: The algorithm selection problem. In: Advances in Computers, vol.\u00a015, pp. 65\u2013118. Elsevier (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2019.04.017","volume":"109","author":"J Schaller","year":"2019","unstructured":"Schaller, J., Valente, J.: Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. Comput. Oper. Res. 109, 1\u201311 (2019)","journal-title":"Comput. Oper. Res."},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Sharma, H., Jain, S.: Online learning algorithms for dynamic scheduling problems. In: 2011 Second International Conference on Emerging Applications of Information Technology, pp. 31\u201334 (2011)","DOI":"10.1109\/EAIT.2011.40"},{"issue":"3","key":"5_CR32","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1007678930559","volume":"38","author":"S Singh","year":"2000","unstructured":"Singh, S., Jaakkola, T., Littman, M.L., Szepesv\u00e1ri, C.: Convergence results for single-step on-policy reinforcement-learning algorithms. Mach. Learn. 38(3), 287\u2013308 (2000). https:\/\/doi.org\/10.1023\/A:1007678930559","journal-title":"Mach. Learn."},{"key":"5_CR33","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement learning: An introduction. MIT press (2018)"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Suwa, H., Sandoh, H.: Online Scheduling in Manufacturing: A Cumulative Delay Approach. Springer Science & Business Media (2012)","DOI":"10.1007\/978-1-4471-4561-5"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Takadama, K., Fujita, H.: Toward guidelines for modeling learning agents in multiagent-based simulation: implications from q-learning and sarsa agents. In: International Workshop on Multi-Agent Systems and Agent-Based Simulation, pp. 159\u2013172. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-32243-6_13","DOI":"10.1007\/978-3-540-32243-6_13"},{"key":"5_CR36","unstructured":"Watkins, C.J.C.H.: Learning from delayed rewards. Thesis Submitted for Ph.D., King\u2019s College, Cambridge (1989)"},{"key":"5_CR37","unstructured":"Xie, S., Zhang, T., Rose, O.: Online single machine scheduling based on simulation and reinforcement learning. In: Simulation in Produktion und Logistik 2019, Simulation in Produktion und Logistik 2019 (2019)"},{"key":"5_CR38","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.cie.2008.01.008","volume":"55","author":"KC Ying","year":"2008","unstructured":"Ying, K.C.: Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm. Comput. Ind. Eng. 55, 494\u2013502 (2008)","journal-title":"Comput. Ind. Eng."},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Zhang, T., Xie, S., Rose, O.: Real-time job shop scheduling based on simulation and markov decision processes. In: 2017 Winter Simulation Conference (WSC), IEEE, pp. 3899\u20133907 (2017). https:\/\/doi.org\/10.1109\/WSC.2017.8248100","DOI":"10.1109\/WSC.2017.8248100"}],"container-title":["Studies in Computational Intelligence","Recent Advances in Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82397-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T07:17:36Z","timestamp":1674026256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82397-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,15]]},"ISBN":["9783030823962","9783030823979"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82397-9_5","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021,12,15]]},"assertion":[{"value":"15 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Workshop on Computational Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 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":"wco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fedcsis.org\/2020\/wco","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}