{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T16:50:12Z","timestamp":1726246212265},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031534447"},{"type":"electronic","value":"9783031534454"}],"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-53445-4_16","type":"book-chapter","created":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:06:36Z","timestamp":1706918796000},"page":"189-199","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimize Maximal Regret to\u00a0Enhance Reliability in\u00a0Flexible Open-Shop Problem"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Bozzi","sequence":"first","affiliation":[]},{"given":"Simone","family":"Graffione","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Sacile","sequence":"additional","affiliation":[]},{"given":"Enrico","family":"Zero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,3]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-02094-0_3","volume-title":"Algorithmics of Large and Complex Networks","author":"F Diedrich","year":"2009","unstructured":"Diedrich, F., Jansen, K., Schwarz, U.M., Trystram, D.: A survey on approximation algorithms for scheduling with machine unavailability. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 50\u201364. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02094-0_3"},{"issue":"13","key":"16_CR2","doi-asserted-by":"publisher","first-page":"3441","DOI":"10.1080\/00207540601161603","volume":"46","author":"W Zhang","year":"2008","unstructured":"Zhang, W., Judd, R.P.: Deadlock avoidance algorithm for flexible manufacturing systems by calculating effective free space of circuits. Int. J. Prod. Res. 46(13), 3441\u20133457 (2008)","journal-title":"Int. J. Prod. Res."},{"key":"16_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.107969","volume":"190","author":"L Wang","year":"2021","unstructured":"Wang, L., Hu, X., Wang, Y., Xu, S., Ma, S., Yang, K., Liu, Z., Wang, W.: Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning. Comput. Netw. 190, 107969 (2021)","journal-title":"Comput. Netw."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TETCI.2022.3145706","volume":"7","author":"Y Du","year":"2022","unstructured":"Du, Y., Li, J.Q., Chen, X.L., Duan, P.Y., Pan, Q.K.: Knowledge-based reinforcement learning and estimation of distribution algorithm for flexible job shop scheduling problem\u2019\u2019. IEEE Trans. Emerg. Topics Comput. Intell. 7, 1036\u20131050 (2022)","journal-title":"IEEE Trans. Emerg. Topics Comput. Intell."},{"key":"16_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2022.102770","volume":"115","author":"S Fatemi-Anaraki","year":"2023","unstructured":"Fatemi-Anaraki, S., Tavakkoli-Moghaddam, R., Foumani, M., Vahedi-Nouri, B.: Scheduling of multi-robot job shop systems in dynamic environments: mixed-integer linear programming and constraint programming approaches. Omega 115, 102770 (2023)","journal-title":"Omega"},{"issue":"6","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1109\/JAS.2020.1003539","volume":"8","author":"Z Zhao","year":"2020","unstructured":"Zhao, Z., Liu, S., Zhou, M., Abusorrah, A.: Dual-objective mixed integer linear program and memetic algorithm for an industrial group scheduling problem. IEEE\/CAA J. Automatica Sinica 8(6), 1199\u20131209 (2020)","journal-title":"IEEE\/CAA J. Automatica Sinica"},{"issue":"11","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1057\/palgrave.jors.2601856","volume":"56","author":"J Wang","year":"2005","unstructured":"Wang, J., Xia, Z.: Flow-shop scheduling with a learning effect. J. Oper. Res. Soc. 56(11), 1325\u20131330 (2005)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1007\/s10845-017-1303-9","volume":"30","author":"A Boudjelida","year":"2019","unstructured":"Boudjelida, A.: On the robustness of joint production and maintenance scheduling in presence of uncertainties. J. Intell. Manuf. 30(4), 1515\u20131530 (2019)","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1080\/0305215X.2019.1607848","volume":"52","author":"W Liao","year":"2020","unstructured":"Liao, W., Fu, Y.: Min-max regret criterion-based robust model for the permutation flow-shop scheduling problem. Eng. Optim. 52(4), 687\u2013700 (2020)","journal-title":"Eng. Optim."},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/adc2.92","volume":"3","author":"Z Dong","year":"2021","unstructured":"Dong, Z., Angeli, D., De Paola, A., Strbac, G.: An iterative algorithm for regret minimization in flexible demand scheduling problems. Adv. Control Appl. Eng. Ind. Syst. 3(4), e92 (2021)","journal-title":"Adv. Control Appl. Eng. Ind. Syst."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.ejor.2004.07.073","volume":"169","author":"I Averbakh","year":"2006","unstructured":"Averbakh, I.: The minmax regret permutation flow-shop problem with two jobs. Eur. J. Oper. Res. 169(3), 761\u2013766 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR12","first-page":"3","volume":"6","author":"M \u0106wik","year":"2015","unstructured":"\u0106wik, M., J\u00f3zefczyk, J.: Evolutionary algorithm for minmax regret flow-shop problem. Manag. Prod. Eng. Rev. 6, 3\u20139 (2015)","journal-title":"Manag. Prod. Eng. Rev."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2022.02.005","volume":"313","author":"M Bold","year":"2022","unstructured":"Bold, M., Goerigk, M.: Investigating the recoverable robust single machine scheduling problem under interval uncertainty. Disc. Appl. Math. 313, 99\u2013114 (2022)","journal-title":"Disc. Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Bozzi, A.,\u00a0Graffione, S.,\u00a0Jim\u00e9nez, J.,\u00a0Sacile, R.,\u00a0Zero, E.: Reliability evaluation of emergent behaviour in a flexible manufacturing problem. In: 2023 18th Annual System of Systems Engineering Conference (SoSe), pp. 1\u20137 (2023)","key":"16_CR14","DOI":"10.1109\/SoSE59841.2023.10178498"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-61310-2_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"AS Schulz","year":"1996","unstructured":"Schulz, A.S.: Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 301\u2013315. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61310-2_23"},{"issue":"9","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1016\/j.conengprac.2013.05.004","volume":"21","author":"D Trentesaux","year":"2013","unstructured":"Trentesaux, D., et al.: Benchmarking flexible job-shop scheduling and control systems. Control. Eng. Pract. 21(9), 1204\u20131225 (2013)","journal-title":"Control. Eng. Pract."}],"container-title":["Studies in Computational Intelligence","Service Oriented, Holonic and Multi-Agent Manufacturing Systems for Industry of the Future"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53445-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:08:38Z","timestamp":1706918918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53445-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031534447","9783031534454"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53445-4_16","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOHOMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Service Orientation in Holonic and Multi-Agent Manufacturing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annecy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"28 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":"sohoma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sohoma2023.sciencesconf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}