{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T13:45:16Z","timestamp":1763300716296,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T00:00:00Z","timestamp":1645142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,2,18]]},"DOI":"10.1145\/3529836.3529928","type":"proceedings-article","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T20:27:55Z","timestamp":1655843275000},"page":"313-317","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerated operating room scheduling using Lagrangian relaxation method and VNS meta-heuristic"],"prefix":"10.1145","author":[{"given":"Maha","family":"TOUB","sequence":"first","affiliation":[{"name":"IT and decision support, National School of Computer Science and Systems Analysis (ENSIAS), Morocco"}]},{"given":"Said","family":"ACHCHAB","sequence":"additional","affiliation":[{"name":"IT and decision support, National School of Computer Science and Systems Analysis (ENSIAS), Morocco"}]},{"given":"Omar","family":"SOUISSI","sequence":"additional","affiliation":[{"name":"Mathematics, computer science and networks, The National Institute of Posts and Telecommunications (INPT), Morocco"}]}],"member":"320","published-online":{"date-parts":[[2022,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2014.11.023"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2009.04.019"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584338"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.5.1114"},{"volume-title":"Approaches to integer programming","author":"Geoffrion M","key":"e_1_3_2_1_5_1","unstructured":"Arthur\u00a0 M Geoffrion . 1974. Lagrangean relaxation for integer programming . In Approaches to integer programming . Springer , 82\u2013114. Arthur\u00a0M Geoffrion. 1974. Lagrangean relaxation for integer programming. In Approaches to integer programming. Springer, 82\u2013114."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.09.003"},{"key":"e_1_3_2_1_7_1","volume-title":"The traveling-salesman problem and minimum spanning trees: Part II. Mathematical programming 1, 1","author":"Held Michael","year":"1971","unstructured":"Michael Held and Richard\u00a0 M Karp . 1971. The traveling-salesman problem and minimum spanning trees: Part II. Mathematical programming 1, 1 ( 1971 ), 6\u201325. Michael Held and Richard\u00a0M Karp. 1971. The traveling-salesman problem and minimum spanning trees: Part II. Mathematical programming 1, 1 (1971), 6\u201325."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.2021.1881359"},{"key":"e_1_3_2_1_9_1","volume-title":"Operating Rooms Planning Using Lagrangian Relaxation Technique. In 2006 IEEE International Conference on Automation Science and Engineering. 176\u2013181","author":"Lamiri Mehdi","year":"2006","unstructured":"Mehdi Lamiri and Xiaolan Xie . 2006 . Operating Rooms Planning Using Lagrangian Relaxation Technique. In 2006 IEEE International Conference on Automation Science and Engineering. 176\u2013181 . Mehdi Lamiri and Xiaolan Xie. 2006. Operating Rooms Planning Using Lagrangian Relaxation Technique. In 2006 IEEE International Conference on Automation Science and Engineering. 176\u2013181."},{"key":"e_1_3_2_1_10_1","unstructured":"Alex Macario. 2008. Are your operating rooms \u2019efficient\u2019?Vol.\u00a023. 16\u20138 pages.  Alex Macario. 2008. Are your operating rooms \u2019efficient\u2019?Vol.\u00a023. 16\u20138 pages."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTMOD49425.2020.9380584"},{"key":"e_1_3_2_1_12_1","first-page":"11","article-title":"Variable Neighborhood","volume":"24","author":"Mladenovi\u0107 N.","year":"1997","unstructured":"N. Mladenovi\u0107 and P. Hansen . 1997 . Variable Neighborhood Search. Comput. Oper. Res. 24 , 11 (Nov. 1997), 1097\u20131100. https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2 N. Mladenovi\u0107 and P. Hansen. 1997. Variable Neighborhood Search. Comput. Oper. Res. 24, 11 (Nov. 1997), 1097\u20131100. https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Search. Comput. Oper. Res."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2010.00767.x"},{"key":"e_1_3_2_1_14_1","volume-title":"A branch and bound algorithm for the generalized assignment problem. Mathematical programming 8, 1","author":"Ross G\u00a0Terry","year":"1975","unstructured":"G\u00a0Terry Ross and Richard\u00a0 M Soland . 1975. A branch and bound algorithm for the generalized assignment problem. Mathematical programming 8, 1 ( 1975 ), 91\u2013103. G\u00a0Terry Ross and Richard\u00a0M Soland. 1975. A branch and bound algorithm for the generalized assignment problem. Mathematical programming 8, 1 (1975), 91\u2013103."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2016.07.915"},{"key":"e_1_3_2_1_16_1","volume-title":"Operating theatre scheduling with fuzzy durations. Journal of Applied Operational Research (01","author":"Souki Mejdi","year":"2011","unstructured":"Mejdi Souki . 2011. Operating theatre scheduling with fuzzy durations. Journal of Applied Operational Research (01 2011 ). Mejdi Souki. 2011. Operating theatre scheduling with fuzzy durations. Journal of Applied Operational Research (01 2011)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IRASET52964.2022.9738371"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJMEI.2022.119307"}],"event":{"name":"ICMLC 2022: 2022 14th International Conference on Machine Learning and Computing","acronym":"ICMLC 2022","location":"Guangzhou China"},"container-title":["2022 14th International Conference on Machine Learning and Computing (ICMLC)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529836.3529928","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3529836.3529928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:26Z","timestamp":1750188686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529836.3529928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,18]]},"references-count":18,"alternative-id":["10.1145\/3529836.3529928","10.1145\/3529836"],"URL":"https:\/\/doi.org\/10.1145\/3529836.3529928","relation":{},"subject":[],"published":{"date-parts":[[2022,2,18]]},"assertion":[{"value":"2022-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}