{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T19:24:36Z","timestamp":1781724276033,"version":"3.54.5"},"reference-count":44,"publisher":"Informa UK Limited","issue":"22","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101567"],"award-info":[{"award-number":["12101567"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071442"],"award-info":[{"award-number":["12071442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901539"],"award-info":[{"award-number":["11901539"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971443"],"award-info":[{"award-number":["11971443"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2023,11,17]]},"DOI":"10.1080\/00207543.2022.2160502","type":"journal-article","created":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T11:37:31Z","timestamp":1672400251000},"page":"7630-7648","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":7,"title":["Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work"],"prefix":"10.1080","volume":"61","author":[{"given":"Rubing","family":"Chen","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan, People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan, People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhichao","family":"Geng","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan, People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-615X","authenticated-orcid":false,"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan, People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2022,12,30]]},"reference":[{"key":"e_1_3_4_2_1","first-page":"415","article-title":"Scheduling Preemptible Tasks on Parallel Processors With Information Loss","volume":"3","author":"Blazewicz J.","year":"1984","unstructured":"Blazewicz, J. 1984. \u201cScheduling Preemptible Tasks on Parallel Processors With Information Loss.\u201d TSI-Technique et Science Informatiques 3: 415\u2013420.","journal-title":"TSI-Technique et Science Informatiques"},{"key":"e_1_3_4_3_1","volume-title":"Scheduling Algorithm","author":"Brucker P.","year":"2008","unstructured":"Brucker, P. 2008. Scheduling Algorithm. Berlin: Springer."},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.107969"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595920500463"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0464-7"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2018.1519073"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.v66.7"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107525"},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.03.002"},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01739-8"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2019.08.002"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105329"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.03.011"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2015.12.006"},{"key":"e_1_3_4_16_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman."},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1456693"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1266055"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-020-00638-7"},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.v69.5"},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408178608975351"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90149-P"},{"key":"e_1_3_4_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.7.2.232"},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-021-00697-2"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1497312"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.1.86"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-020-00646-7"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1321804"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-021-00697-4"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108168"},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.12.061"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-022-00743-9"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595919500325"},{"key":"e_1_3_4_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.3.586"},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90001-J"},{"key":"e_1_3_4_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00316-X"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.02.017"},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1002\/(ISSN)1520-6750"},{"key":"e_1_3_4_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.06.006"},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102453"},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1346317"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.08.008"},{"key":"e_1_3_4_43_1","unstructured":"Yuan J. J. 2022. \u201cThe Scheduling Problem With Assignable or Generalized Due Dates to Minimize Total Weighted Late Work.\u201d In Symposium on Combinatorial Optimization and Graph Theory Nanjing University June 2022. https:\/\/math.nju.edu.cn\/fzlm\/xshy19082\/20220614\/i223737.html."},{"key":"e_1_3_4_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2021.126286"},{"key":"e_1_3_4_45_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.v68.3"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2022.2160502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T06:41:21Z","timestamp":1708065681000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2022.2160502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,30]]},"references-count":44,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2023,11,17]]}},"alternative-id":["10.1080\/00207543.2022.2160502"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2022.2160502","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,30]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-06-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}