{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T02:21:48Z","timestamp":1773109308672,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T00:00:00Z","timestamp":1658793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T00:00:00Z","timestamp":1658793600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11590-022-01913-6","type":"journal-article","created":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T07:02:48Z","timestamp":1658818968000},"page":"2169-2184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Variable neighborhood search for the single machine scheduling problem to minimize the total early work"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-4116","authenticated-orcid":false,"given":"Rachid","family":"Benmansour","sequence":"first","affiliation":[]},{"given":"Raca","family":"Todosijevi\u0107","sequence":"additional","affiliation":[]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,26]]},"reference":[{"issue":"1","key":"1913_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10479-019-03250-x","volume":"285","author":"G Alhadi","year":"2020","unstructured":"Alhadi, G., Kacem, I., Laroche, P., Osman, I.M.: Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. Ann. Oper. Res. 285(1), 369\u2013395 (2020)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"1913_CR2","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.omega.2009.12.006","volume":"38","author":"M Almi\u00f1ana","year":"2010","unstructured":"Almi\u00f1ana, M., Escudero, L., Landete, M., Monge, J., Rabasa, A., S\u00e1nchez-Soriano, J.: Wische: A dss for water irrigation scheduling. Omega 38(6), 492\u2013500 (2010)","journal-title":"Omega"},{"key":"1913_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cor.2016.03.010","volume":"73","author":"Y Ben-Yehoshua","year":"2016","unstructured":"Ben-Yehoshua, Y., Mosheiov, G.: A single machine scheduling problem to minimize total early work. Comput. Oper. Res. 73, 115\u2013118 (2016)","journal-title":"Comput. Oper. Res."},{"key":"1913_CR4","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.cor.2014.02.004","volume":"47","author":"R Benmansour","year":"2014","unstructured":"Benmansour, R., Allaoui, H., Artiba, A., Hanafi, S.: Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance. Comput. Oper. Res. 47, 106\u2013113 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"2000","key":"1913_CR5","first-page":"1195","volume":"26","author":"J Blazewicz","year":"1984","unstructured":"Blazewicz, J.: Scheduling preemptible tasks on parallel processors with information with loss. Parallel Comput. 26(2000), 1195\u20131211 (1984)","journal-title":"Parallel Comput."},{"key":"1913_CR6","unstructured":"B\u0142aewicz, J., Ecker, KH., Pesch, E., Schmidt, G., Weglarz, J.: (2007) Handbook on scheduling: from theory to applications. Springer Science & Business Media"},{"key":"1913_CR7","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10951-020-00636-9","volume":"24","author":"X Chen","year":"2020","unstructured":"Chen, X., Kovalev, S., Sterna, M., Blazewicz, J.: Mirror scheduling problems with early work and late work criteria. J. Scheduling 24, 483\u2013487 (2020)","journal-title":"J. Scheduling"},{"key":"1913_CR8","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 174. Freeman, San Francisco (1979)"},{"key":"1913_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"1913_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Operat. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Operat. Res."},{"issue":"3","key":"1913_CR11","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. Optimiz. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optimiz."},{"issue":"1","key":"1913_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0166-218X(90)90093-R","volume":"28","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shamir, R.: Minimizing the number of tardy job units under release time constraints. Discrete Appl. Math. 28(1), 45\u201357 (1990)","journal-title":"Discrete Appl. Math."},{"key":"1913_CR13","doi-asserted-by":"crossref","unstructured":"Khalouli, S., Benmansour, R., Hanafi, S.: An ant colony algorithm based on opportunities for scheduling the preventive railway maintenance. In: 2016 International Conference on Control, pp. 594\u2013599. Decision and Information Technologies (CoDIT), IEEE (2016)","DOI":"10.1109\/CoDIT.2016.7593629"},{"issue":"1\u20132","key":"1913_CR14","first-page":"78","volume":"6","author":"S Khalouli","year":"2018","unstructured":"Khalouli, S., Benmansour, R., Hanafi, S.: Ant colony optimisation combined with variable neighbourhood search for scheduling preventive railway maintenance activities. Int. J. Intell. Eng. Info. 6(1\u20132), 78\u201398 (2018)","journal-title":"Int. J. Intell. Eng. Info."},{"issue":"2","key":"1913_CR15","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10898-020-00884-1","volume":"78","author":"I Krimi","year":"2020","unstructured":"Krimi, I., Todosijevi\u0107, R., Benmansour, R., Ratli, M., El Cadi, A.A., Aloullal, A.: Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints. J. Global Optimiz. 78(2), 349\u2013373 (2020)","journal-title":"J. Global Optimiz."},{"issue":"1","key":"1913_CR16","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ejor.2017.05.001","volume":"263","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez, B., Bustillo, M., Pardo, E.G., Duarte, A.: General variable neighborhood search for the order batching and sequencing problem. Eur. J. Operat. Res. 263(1), 82\u201393 (2017)","journal-title":"Eur. J. Operat. Res."},{"key":"1913_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.cor.2019.05.020","volume":"110","author":"M Miki\u0107","year":"2019","unstructured":"Miki\u0107, M., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Less is more: general variable neighborhood search for the capacitated modular hub location problem. Comput. Oper. Res. 110, 101\u2013115 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1913_CR18","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1111\/itor.12282","volume":"24","author":"A Mjirda","year":"2017","unstructured":"Mjirda, A., Todosijevi\u0107, R., Hanafi, S., Hansen, P., Mladenovi\u0107, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24(3), 615\u2013633 (2017)","journal-title":"Int. Trans. Oper. Res."},{"issue":"11","key":"1913_CR19","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."},{"issue":"2","key":"1913_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10951-015-0429-x","volume":"19","author":"R M\u2019Hallah","year":"2016","unstructured":"M\u2019Hallah, R., Alhajraf, A.: Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem. J. Scheduling 19(2), 191\u2013205 (2016)","journal-title":"J. Scheduling"},{"issue":"3","key":"1913_CR21","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1992","unstructured":"Potts, C.N., Van Wassenhove, L.N.: Single machine scheduling to minimize total late work. Oper. Res. 40(3), 586\u2013595 (1992)","journal-title":"Oper. Res."},{"issue":"03","key":"1913_CR22","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1142\/S0217595909002249","volume":"26","author":"J Ren","year":"2009","unstructured":"Ren, J., Zhang, Y., Sun, G.: The np-hardness of minimizing the total late work on an unbounded batch machine. Asia-Pacific J. Oper. Res. 26(03), 351\u2013363 (2009)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"6","key":"1913_CR23","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1007\/s11590-014-0793-z","volume":"11","author":"J S\u00e1nchez-Oro","year":"2017","unstructured":"S\u00e1nchez-Oro, J., Mladenovi\u0107, N., Duarte, A.: General variable neighborhood search for computing graph separators. Optimiz. Lett. 11(6), 1069\u20131089 (2017)","journal-title":"Optimiz. Lett."},{"issue":"2","key":"1913_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","volume":"39","author":"M Sterna","year":"2011","unstructured":"Sterna, M.: A survey of scheduling problems with late work criteria. Omega 39(2), 120\u2013129 (2011)","journal-title":"Omega"},{"key":"1913_CR25","doi-asserted-by":"crossref","unstructured":"Sterna, M.: (2021) Late and early work scheduling: a survey. Omega p 102453","DOI":"10.1016\/j.omega.2021.102453"},{"issue":"2","key":"1913_CR26","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ejor.2016.01.014","volume":"252","author":"R Todosijevi\u0107","year":"2016","unstructured":"Todosijevi\u0107, R., Benmansour, R., Hanafi, S., Mladenovi\u0107, N., Artiba, A.: Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252(2), 385\u2013396 (2016)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01913-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01913-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01913-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T11:04:35Z","timestamp":1698663875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01913-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,26]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1913"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01913-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,26]]},"assertion":[{"value":"28 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}