{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T15:32:30Z","timestamp":1759159950985,"version":"3.40.5"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T00:00:00Z","timestamp":1697328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T00:00:00Z","timestamp":1697328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071442","11971228"],"award-info":[{"award-number":["12071442","11971228"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["020314380035","11971011"],"award-info":[{"award-number":["020314380035","11971011"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10951-023-00793-7","type":"journal-article","created":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T15:01:17Z","timestamp":1697382077000},"page":"309-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Single-machine primary\u2013secondary scheduling with total tardiness being the primary criterion"],"prefix":"10.1007","volume":"27","author":[{"given":"Qiulan","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-615X","authenticated-orcid":false,"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,15]]},"reference":[{"key":"793_CR1","doi-asserted-by":"crossref","unstructured":"Agnetis, A., Billaut, J. C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling: Models and algorithms. Springer.","DOI":"10.1007\/978-3-642-41880-8"},{"issue":"1","key":"793_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/opre.39.1.64","volume":"39","author":"EM Arkin","year":"1991","unstructured":"Arkin, E. M., & Roundy, R. O. (1991). Weighted-tardiness scheduling on parallel machines with proportional weights. Operations Research, 39(1), 64\u201381.","journal-title":"Operations Research"},{"issue":"5","key":"793_CR3","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10951-019-00615-9","volume":"22","author":"RB Chen","year":"2019","unstructured":"Chen, R. B., & Yuan, J. J. (2019). Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. Journal of Scheduling, 22(5), 595\u2013601.","journal-title":"Journal of Scheduling"},{"issue":"10","key":"793_CR4","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1057\/palgrave.jors.2600624","volume":"49","author":"F Della Croce","year":"1998","unstructured":"Della Croce, F., Tadei, R., Baracco, P., & Grosso, A. (1998). A new decomposition approach for the single machine total tardiness scheduling problem. Journal of the Operational Research Society, 49(10), 1101\u20131106.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"793_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"JZ Du","year":"1990","unstructured":"Du, J. Z., & Leung, J.Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"793_CR6","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/opre.17.4.701","volume":"17","author":"H Emmons","year":"1969","unstructured":"Emmons, H. (1969). One-machine sequencing to minimize certain functions of job tardiness. Operations Research, 17(4), 701\u2013715.","journal-title":"Operations Research"},{"issue":"3","key":"793_CR7","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operational Research, 167(3), 592\u2013623.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"793_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.orl.2006.01.007","volume":"35","author":"YM Huo","year":"2007","unstructured":"Huo, Y. M., Leung, J.Y.-T., & Zhao, H. R. (2007). Complexity of two-dual criteria scheduling problems. Operations Research Letters, 35(2), 211\u2013220.","journal-title":"Operations Research Letters"},{"issue":"2","key":"793_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(00)00207-1","volume":"133","author":"C Koulamas","year":"2001","unstructured":"Koulamas, C., & Kyparisis, G. J. (2001). Single machine scheduling with release times, deadlines and tardiness objectives. European Journal of Operational Research, 133(2), 447\u2013453.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"793_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler, E. L. (1977). A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1(1), 331\u2013342.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"793_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler, E. L., & Moore, J. M. (1969). A functional equation and its applications to resource allocation and sequencing problems. Management Science, 16(1), 77\u201384.","journal-title":"Management Science"},{"key":"793_CR12","doi-asserted-by":"crossref","unstructured":"Lee, C. Y., & Vairaktarakis, G. (1993). Complexity of single machine hierarchical scheduling: A survey. In P. M. Pardalos (Ed.), Complexity in numerical optimization (pp. 269\u2013298). World Scientific.","DOI":"10.1142\/9789814354363_0013"},{"issue":"1","key":"793_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1(1), 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"793_CR14","doi-asserted-by":"crossref","unstructured":"Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the Association of Computing Machinery, 23(1), 116\u2013127.","DOI":"10.1145\/321921.321934"},{"issue":"1","key":"793_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"793_CR16","unstructured":"T\u2019kindt, V. & Billaut, J. C. (2006). Multicriteria scheduling: Theory, models and algorithms (2nd ed.). Springer."},{"issue":"2","key":"793_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10951-016-0479-8","volume":"20","author":"JJ Yuan","year":"2017","unstructured":"Yuan, J. J. (2017). Unary NP-hardness of minimizing the number of tardy jobs with deadlines. Journal of Scheduling, 20(2), 211\u2013218.","journal-title":"Journal of Scheduling"},{"key":"793_CR18","unstructured":"Yuan, J.J. (2021). Updated complexity results in single-machine primary\u2013secondary scheduling for minimizing two regular criteria. Global Scheduling Seminar: https:\/\/schedulingseminar.com"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00793-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00793-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00793-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T07:19:08Z","timestamp":1747293548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00793-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,15]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["793"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00793-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2023,10,15]]},"assertion":[{"value":"18 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}