{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T12:07:36Z","timestamp":1774958856955,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031629112","type":"print"},{"value":"9783031629129","type":"electronic"}],"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-62912-9_28","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"291-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Advanced Algorithms for\u00a0the\u00a0Reclaimer Scheduling Problem with\u00a0Sequence-Dependent Setup Times and\u00a0Availability Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3404-4136","authenticated-orcid":false,"given":"Oualid","family":"Benbrik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-4116","authenticated-orcid":false,"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5024-6610","authenticated-orcid":false,"given":"Abdelhak","family":"Elidrissi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5696-7021","authenticated-orcid":false,"given":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10951-015-0436-y","volume":"19","author":"E Angelelli","year":"2016","unstructured":"Angelelli, E., Kalinowski, T., Kapoor, R., Savelsbergh, M.W.: A reclaimer scheduling problem arising in coal stockyard management. J. Sched. 19, 563\u2013582 (2016)","journal-title":"J. Sched."},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10732-019-09435-8","volume":"26","author":"G Belov","year":"2020","unstructured":"Belov, G., Boland, N.L., Savelsbergh, M.W., Stuckey, P.J.: Logistics optimization for a coal supply chain. J. Heuristics 26(2), 269\u2013300 (2020)","journal-title":"J. Heuristics"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.procs.2024.02.112","volume":"232","author":"O Benbrik","year":"2024","unstructured":"Benbrik, O., Benmansour, R., Elidrissi, A.: Mathematical programming formulations for the reclaimer scheduling problem with sequence-dependent setup times and availability constraints. Procedia Comput. Sci. 232, 2959\u20132972 (2024). https:\/\/doi.org\/10.1016\/j.procs.2024.02.112","journal-title":"Procedia Comput. Sci."},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-030-15843-9_16","volume-title":"Variable Neighborhood Search","author":"R Benmansour","year":"2019","unstructured":"Benmansour, R., Braun, O., Hanafi, S., Mladenovic, N.: Using a variable neighborhood search to solve the single processor scheduling problem with time restrictions. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds.) ICVNS 2018. LNCS, vol. 11328, pp. 202\u2013215. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-15843-9_16"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-69625-2_6","volume-title":"Variable Neighborhood Search","author":"R Benmansour","year":"2021","unstructured":"Benmansour, R., Sifaleras, A.: Scheduling in parallel machines with two servers: the restrictive case. In: Mladenovic, N., Sleptchenko, A., Sifaleras, A., Omar, M. (eds.) ICVNS 2021. LNCS, vol. 12559, pp. 71\u201382. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-69625-2_6"},{"issue":"9","key":"28_CR6","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1007\/s11590-022-01913-6","volume":"17","author":"R Benmansour","year":"2023","unstructured":"Benmansour, R., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search for the single machine scheduling problem to minimize the total early work. Optim. Lett. 17(9), 2169\u20132184 (2023)","journal-title":"Optim. Lett."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-0-85729-778-5_10","volume-title":"Supply Chain Disruptions: Theory and Practice of Managing Risk","author":"NL Boland","year":"2011","unstructured":"Boland, N.L., Savelsbergh, M.W.P.: Optimizing the Hunter Valley coal chain. In: Gurnani, H., Mehrotra, A., Ray, S. (eds.) Supply Chain Disruptions: Theory and Practice of Managing Risk, pp. 275\u2013302. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-0-85729-778-5_10"},{"issue":"9","key":"28_CR8","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1007\/s11590-022-01925-2","volume":"17","author":"A Elidrissi","year":"2023","unstructured":"Elidrissi, A., Benmansour, R., Sifaleras, A.: General variable neighborhood search for the parallel machine scheduling problem with two common servers. Optim. Lett. 17(9), 2201\u20132231 (2023)","journal-title":"Optim. Lett."},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"11","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1080\/0951192X.2012.684707","volume":"25","author":"D Hu","year":"2012","unstructured":"Hu, D., Yao, Z.: Stacker-reclaimer scheduling in a dry bulk terminal. Int. J. Comput. Integr. Manuf. 25(11), 1047\u20131058 (2012)","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10951-016-0495-8","volume":"20","author":"T Kalinowski","year":"2017","unstructured":"Kalinowski, T., Kapoor, R., Savelsbergh, M.W.: Scheduling reclaimers serving a stock pad at a coal terminal. J. Sched. 20, 85\u2013101 (2017)","journal-title":"J. Sched."},{"issue":"11","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.cor.2013.11.008","volume":"52","author":"J S\u00e1nchez-Oro","year":"2014","unstructured":"S\u00e1nchez-Oro, J., Pantrigo, J.J., Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput. Oper. Res. 52, 209\u2013219 (2014)","journal-title":"Comput. Oper. Res."},{"key":"28_CR14","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-37157-9_5","volume-title":"Network Algorithms, Data Mining, and Applications","author":"A Sifaleras","year":"2020","unstructured":"Sifaleras, A., Konstantaras, I.: A survey on variable neighborhood search methods for supply network inventory. In: Bychkov, I., Kalyagin, V.A., Pardalos, P.M., Prokopyev, O. (eds.) NET 2018. SPMS, vol. 315, pp. 71\u201382. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-37157-9_5"},{"key":"28_CR15","unstructured":"UNCTAD: Review of maritime transport. United Nations Conference on Trade and Development (2022). http:\/\/www.unctad.org"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"96294","DOI":"10.1109\/ACCESS.2020.2997739","volume":"8","author":"\u00d6 \u00dcnsal","year":"2020","unstructured":"\u00dcnsal, \u00d6.: Reclaimer scheduling in dry bulk terminals. IEEE Access 8, 96294\u201396303 (2020)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62912-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:11:57Z","timestamp":1718550717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lorient","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mic2024.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}