{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:13:37Z","timestamp":1768522417716,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"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-01849-x","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T06:03:47Z","timestamp":1643868227000},"page":"2113-2131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A no-delay single machine scheduling problem to minimize total weighted early and late work"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7698-9060","authenticated-orcid":false,"given":"Issam","family":"Krimi","sequence":"first","affiliation":[]},{"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[]},{"given":"Raca","family":"Todosijevi\u0107","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovic","sequence":"additional","affiliation":[]},{"given":"Mustapha","family":"Ratli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"key":"1849_CR1","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":"1849_CR2","doi-asserted-by":"crossref","unstructured":"B\u0142a\u017cewicz, J., Pesch, E., Sterna, M., Werner, F.: Open shop scheduling problems with late work criteria. Discrete Appl. Math. 134(1\u20133), 1\u201324 (2004).","DOI":"10.1016\/S0166-218X(03)00339-1"},{"issue":"2","key":"1849_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"KD Boese","year":"1994","unstructured":"Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16(2), 101\u2013113 (1994).","journal-title":"Oper. Res. Lett."},{"key":"1849_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.dam.2020.05.023","volume":"290","author":"X Chen","year":"2021","unstructured":"Chen, X., Kovalev, S., Liu, Y., Sterna, M., Chalamon, I., B\u0142a\u017cewicz, J.: Semi-online scheduling on two identical machines with a common due date to maximize total early work. Discrete Appl. Math. 290, 71\u201378 (2021).","journal-title":"Discrete Appl. Math."},{"key":"1849_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Kovalev, S., Sterna, M., B\u0142a\u017cewicz, J.: Mirror scheduling problems with early work and late work criteria. J. Sched. pp 1\u20135 (2020)","DOI":"10.1007\/s10951-020-00636-9"},{"issue":"7","key":"1849_CR6","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1080\/0305215X.2018.1519073","volume":"51","author":"X Chen","year":"2019","unstructured":"Chen, X., Wang, Z., Pesch, E., Sterna, M., B\u0142a\u017cewicz, J.: Two-machine flow-shop scheduling to minimize total late work: revisited. Eng. Optim. 51(7), 1268\u20131278 (2019).","journal-title":"Eng. Optim."},{"issue":"6","key":"1849_CR7","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40(6), 1086\u20131094 (1992).","journal-title":"Oper. Res."},{"issue":"3","key":"1849_CR8","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":"2","key":"1849_CR9","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/ijoc.7.2.232","volume":"7","author":"AM Hariri","year":"1995","unstructured":"Hariri, A.M., Potts, C.N., Van Wassenhove, L.N.: Single machine scheduling to minimize total weighted late work. ORSA J. Comput. 7(2), 232\u2013242 (1995).","journal-title":"ORSA J. Comput."},{"issue":"2","key":"1849_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/07408179608966258","volume":"28","author":"DW He","year":"1996","unstructured":"He, D.W., Kusiak, A., Artiba, A.: A scheduling problem in glass manufacturing. IIE Trans. 28(2), 129\u2013139 (1996).","journal-title":"IIE Trans."},{"issue":"3","key":"1849_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0360-8352(02)00123-7","volume":"43","author":"RB Kethley","year":"2002","unstructured":"Kethley, R.B., Alidaee, B.: Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms. Comput. Ind. Eng. 43(3), 509\u2013528 (2002).","journal-title":"Comput. Ind. Eng."},{"key":"1849_CR12","doi-asserted-by":"crossref","unstructured":"Li, S.S., Yuan, J.J.: Single-machine scheduling with multi-agents to minimize total weighted late work. J. Sched. pp 1\u201316 (2020)","DOI":"10.1007\/s10951-020-00646-7"},{"key":"1849_CR13","doi-asserted-by":"crossref","unstructured":"Mosheiov, G., Oron, D., Shabtay, D.: Minimizing total late work on a single machine with generalized due-dates. Eur. J. Oper. Res. (2021)","DOI":"10.1016\/j.ejor.2020.12.061"},{"issue":"5","key":"1849_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0167-6377(92)90001-J","volume":"11","author":"CN Potts","year":"1992","unstructured":"Potts, C.N., Van Wassenhove, L.N.: Approximation algorithms for scheduling a single machine to minimize total late work. Oper. Res. Lett. 11(5), 261\u2013266 (1992).","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1849_CR15","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."},{"key":"1849_CR16","doi-asserted-by":"crossref","unstructured":"Resende, M.G., Ribeiro, C.C.: Grasp: Greedy randomized adaptive search procedures. In: Search methodologies, pp. 287\u2013312. Springer (2014)","DOI":"10.1007\/978-1-4614-6940-7_11"},{"key":"1849_CR17","doi-asserted-by":"crossref","unstructured":"Ronald, S.: More distance functions for order-based encodings. In: 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98TH8360), pp. 558\u2013563. IEEE (1998)","DOI":"10.1109\/ICEC.1998.700089"},{"issue":"2","key":"1849_CR18","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":"1849_CR19","doi-asserted-by":"crossref","unstructured":"Sterna, M.: Late and early work scheduling: a survey. Omega p. 102453 (2021)","DOI":"10.1016\/j.omega.2021.102453"},{"issue":"4","key":"1849_CR20","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1007\/s00500-015-1590-z","volume":"20","author":"CC Wu","year":"2016","unstructured":"Wu, C.C., Yin, Y., Wu, W.H., Chen, H.M., Cheng, S.R.: Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem. Soft Comput. 20(4), 1329\u20131339 (2016).","journal-title":"Soft Comput."}],"updated-by":[{"DOI":"10.1007\/s11590-022-01860-2","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T00:00:00Z","timestamp":1646265600000}}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01849-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01849-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01849-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T20:24:41Z","timestamp":1726604681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01849-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1849"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01849-x","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s11590-022-01860-2","asserted-by":"object"}]},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"26 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2022","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11590-022-01860-2","URL":"https:\/\/doi.org\/10.1007\/s11590-022-01860-2","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}