{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:40:37Z","timestamp":1756190437945,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10288-022-00517-1","type":"journal-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T15:03:53Z","timestamp":1655737433000},"page":"421-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work"],"prefix":"10.1007","volume":"21","author":[{"given":"Yunhong","family":"Min","sequence":"first","affiliation":[]},{"given":"Byung-Cheon","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Myoung-Ju","family":"Park","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7491-9595","authenticated-orcid":false,"given":"Kyung Min","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"issue":"15\u201316","key":"517_CR1","doi-asserted-by":"publisher","first-page":"3975","DOI":"10.1016\/j.apm.2014.01.006","volume":"38","author":"F Abasian","year":"2014","unstructured":"Abasian F, Ranjbar M, Salari M, Davari M, Khatami SM (2014) Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays. Appl. Math. Modell. 38(15\u201316):3975\u20133986","journal-title":"Appl. Math. Modell."},{"issue":"4","key":"517_CR2","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1080\/0305215X.2015.1042475","volume":"48","author":"M Afzalirad","year":"2016","unstructured":"Afzalirad M, Rezaeian J (2016) Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints. Eng. Optim. 48(4):706\u2013726","journal-title":"Eng. Optim."},{"key":"517_CR3","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RA Ahuja","year":"1990","unstructured":"Ahuja RA, Mehlhorn K, Orlin JB (1990) Faster algorithm for the shortest path problem. J. Ass. Comput. Mach. 37:213\u2013223","journal-title":"J. Ass. Comput. Mach."},{"issue":"9","key":"517_CR4","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1287\/mnsc.30.9.1093","volume":"30","author":"KR Baker","year":"1984","unstructured":"Baker KR (1984) Sequencing rules and due-date assignments in a job shop. Manag. Sci. 30(9):1093\u20131104","journal-title":"Manag. Sci."},{"issue":"6","key":"517_CR5","first-page":"415","volume":"3","author":"J Blazewicz","year":"1984","unstructured":"Blazewicz J (1984) Scheduling preemptible tasks on parallel processors with information loss. Tech. et Sci. Info. 3(6):415\u2013420","journal-title":"Tech. et Sci. Info."},{"issue":"4","key":"517_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(87)90145-1","volume":"24","author":"J Blazewicz","year":"1987","unstructured":"Blazewicz J, Finke G (1987) Minimizing mean weighted execution time loss on identical and uniform processors. Info. Process. Lett. 24(4):259\u2013263","journal-title":"Info. Process. Lett."},{"issue":"1","key":"517_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2019.12.003","volume":"284","author":"X Chen","year":"2020","unstructured":"Chen X, Liang Y, Sterna M, Wang W, Blazewicz J (2020) Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. European J. Oper. Res. 284(1):67\u201374","journal-title":"European J. Oper. Res."},{"issue":"6","key":"517_CR8","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10951-015-0464-7","volume":"19","author":"X Chen","year":"2016","unstructured":"Chen X, Sterna M, Han X, Blazewicz J (2016) Scheduling on parallel identical machines with late work criterion: Offline and online cases. J. Sche. 19(6):729\u2013736","journal-title":"J. Sche."},{"key":"517_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106449","volume":"144","author":"X Chen","year":"2020","unstructured":"Chen X, Wang W, Xie P, Zhang X, Sterna M, Blazewicz J (2020) Exact and heuristic algorithms for scheduling on two identical machines with early work maximization. Comput. & Ind. Eng. 144:106449","journal-title":"Comput. & Ind. Eng."},{"issue":"6","key":"517_CR10","doi-asserted-by":"publisher","first-page":"2150007","DOI":"10.1142\/S021759592150007X","volume":"38","author":"B-C Choi","year":"2021","unstructured":"Choi B-C, Min Y, Kim KM, Park M-J (2021) A parallel machine scheduling problem maximizing total weighted early work. Asia-Pacific J. Oper. Res. 38(6):2150007","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"517_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ipl.2014.09.005","volume":"115","author":"Y Chung","year":"2015","unstructured":"Chung Y, Park M-J (2015) Notes on inverse bin-packing problems. Info. Process. Lett. 115:60\u201368","journal-title":"Info. Process. Lett."},{"issue":"6","key":"517_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10951-018-0566-0","volume":"21","author":"D Dereniowski","year":"2018","unstructured":"Dereniowski D, Kubiak W (2018) Shared processor scheduling. J. Sched. 21(6):583\u2013593","journal-title":"J. Sched."},{"doi-asserted-by":"crossref","unstructured":"Gerstl E, Mosheiov G (2020) Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. J. Sched. 23:289??99","key":"517_CR13","DOI":"10.1007\/s10951-020-00638-7"},{"key":"517_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.107091","volume":"153","author":"Y Jiang","year":"2021","unstructured":"Jiang Y, Guan L, Zhang K, Liu C, Cheng TCE, Ji M (2021) A note on scheduling on two identical machines with early work maximization. Comput Ind Eng 153:107091. https:\/\/doi.org\/10.1016\/j.cie.2020.107091","journal-title":"Comput Ind Eng"},{"unstructured":"Leung J (2004) Minimizing total weighted error for imprecise computation tasks and related problems. In Handbook of scheduling: algorithms, models, and performance analysis (pp. 34.1\u201334.16). CRC Press","key":"517_CR15"},{"key":"517_CR16","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 (2011) A survey of scheduling problems with late work criteria. Omega 39:120\u2013129","journal-title":"Omega"},{"key":"517_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102453","volume":"104","author":"M Sterna","year":"2021","unstructured":"Sterna M (2021) Late and early work scheduling: A survey. Omega 104:102453","journal-title":"Omega"},{"issue":"3","key":"517_CR18","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s10957-017-1147-7","volume":"174","author":"M Sterna","year":"2017","unstructured":"Sterna M, Czerniachowska K (2017) Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work. J. Optim. Theory and Appl. 174(3):927\u2013944","journal-title":"J. Optim. Theory and Appl."},{"issue":"3","key":"517_CR19","first-page":"573","volume":"30","author":"W Wang","year":"2020","unstructured":"Wang W, Chen X, Musial J, Blazewicz J (2020) Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion. Intern. J. Appl. Math. Comput. Sci. 30(3):573\u2013584","journal-title":"Intern. J. Appl. Math. Comput. Sci."},{"issue":"1","key":"517_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40064-015-1559-5","volume":"4","author":"Z Xu","year":"2015","unstructured":"Xu Z, Zou Y, Kong X (2015) Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date. SpringerPlus 4(1):1\u201313","journal-title":"SpringerPlus"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00517-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-022-00517-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00517-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:03:28Z","timestamp":1695665008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-022-00517-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["517"],"URL":"https:\/\/doi.org\/10.1007\/s10288-022-00517-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"17 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}