{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:44:05Z","timestamp":1767192245839,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11901539"],"award-info":[{"award-number":["11901539"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2019M652555"],"award-info":[{"award-number":["2019M652555"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671368","11771406"],"award-info":[{"award-number":["11671368","11771406"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s11590-020-01576-1","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T11:18:30Z","timestamp":1585912710000},"page":"249-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A note on competing-agent Pareto-scheduling"],"prefix":"10.1007","volume":"15","author":[{"given":"Yuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. T.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,3]]},"reference":[{"key":"1576_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent Scheduling: Models and Algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Billaut, J.C., Gawiejnowicz, S., Pacciarelli, D., Soukhal, A.: Multiagent Scheduling: Models and Algorithms. Springer, Berlin (2014)"},{"key":"1576_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52, 229\u2013242 (2004)","journal-title":"Oper. Res."},{"key":"1576_CR3","doi-asserted-by":"publisher","first-page":"100549","DOI":"10.1016\/j.disopt.2019.06.002","volume":"34","author":"RB Chen","year":"2019","unstructured":"Chen, R.B., Yuan, J.J., Lu, L.F.: Single-machine scheduling with positional due indices and positional deadlines. Discrete Optim. 34, 100549 (2019)","journal-title":"Discrete Optim."},{"key":"1576_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-019-00410-4","author":"RB Chen","year":"2019","unstructured":"Chen, R.B., Yuan, J.J.: Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR Q. J. Oper. Res. (2019). https:\/\/doi.org\/10.1007\/s10288-019-00410-4","journal-title":"4OR Q. J. Oper. Res."},{"key":"1576_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s40305-015-0083-1","volume":"3","author":"Y Gao","year":"2015","unstructured":"Gao, Y., Yuan, J.J.: Pareto minimizing total completion time and maximum cost with positional due indices. J. Oper. Res. Soc. China 3, 381\u2013387 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"key":"1576_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.disopt.2017.02.004","volume":"25","author":"Y Gao","year":"2017","unstructured":"Gao, Y., Yuan, J.J.: Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. Discrete Optim. 25, 105\u2013119 (2017)","journal-title":"Discrete Optim."},{"key":"1576_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2014.12.020","volume":"570","author":"ZC Geng","year":"2015","unstructured":"Geng, Z.C., Yuan, J.J.: Pareto optimization scheduling of family jobs on a $$p$$-batch machine to minimize makespan and maximum lateness. Theor. Comput. Sci. 570, 22\u201329 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"1576_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10288-013-0244-1","volume":"12","author":"C He","year":"2014","unstructured":"He, C., Lin, H., Wang, X.M.: Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost. 4OR Q. J. Oper. Res. 12, 87\u201393 (2014)","journal-title":"4OR Q. J. Oper. Res."},{"key":"1576_CR9","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.: Multicriteria scheduling. Eur. J. Oper. Res. 167, 592\u2013623 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"1576_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0167-6377(95)00023-D","volume":"17","author":"JA Hoogeveen","year":"1995","unstructured":"Hoogeveen, J.A., van de Velde, S.L.: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett. 17, 205\u2013208 (1995)","journal-title":"Oper. Res. Lett."},{"key":"1576_CR11","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1006\/jagm.1996.0051","volume":"21","author":"JA Hoogeveen","year":"1996","unstructured":"Hoogeveen, J.A.: Single machine scheduling to minimize a function of two or three maximum cost criteria. J. Algorithms 21, 415\u2013433 (1996)","journal-title":"J. Algorithms"},{"key":"1576_CR12","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"key":"1576_CR13","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.: A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1, 331\u2013342 (1977)","journal-title":"Ann. Discrete Math."},{"key":"1576_CR14","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(80)90111-3","volume":"4","author":"JK Lenstra","year":"1980","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity results for scheduling chains on a single machine. Eur. J. Oper. Res. 4, 270\u2013275 (1980)","journal-title":"Eur. J. Oper. Res."},{"key":"1576_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2015.01.003","volume":"244","author":"D Oron","year":"2015","unstructured":"Oron, D., Shabtay, D., Steiner, G.: Single machine scheduling with two competing agents and equal job processing times. Eur. J. Oper. Res. 244, 86\u201399 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1576_CR16","volume-title":"Multicriteria Scheduling: Theory, Models and Algorithms","author":"V T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., Billaut, J.C.: Multicriteria Scheduling: Theory, Models and Algorithms, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"1576_CR17","first-page":"912","volume":"273","author":"L Wan","year":"2016","unstructured":"Wan, L., Yuan, J.J., Wei, L.J.: Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost. Appl. Math. Comput. 273, 912\u2013923 (2016)","journal-title":"Appl. Math. Comput."},{"key":"1576_CR18","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.: Unary NP-hardness of minimizing the number of tardy jobs with deadlines. J. Sched. 20, 211\u2013218 (2017)","journal-title":"J. Sched."},{"key":"1576_CR19","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s10878-018-0337-z","volume":"37","author":"Y Zhang","year":"2019","unstructured":"Zhang, Y., Yuan, J.J.: A note on a two-agent scheduling problem related to the total weighted late work. J. Comb. Optim. 37, 989\u2013999 (2019)","journal-title":"J. Comb. Optim."},{"issue":"05","key":"1576_CR20","doi-asserted-by":"publisher","first-page":"1750024","DOI":"10.1142\/S0217595917500245","volume":"34","author":"QL Zhao","year":"2017","unstructured":"Zhao, Q.L., Yuan, J.J.: Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs. Asia Pac. J. Oper. Res. 34(05), 1750024 (2017). https:\/\/doi.org\/10.1142\/S0217595917500245","journal-title":"Asia Pac. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01576-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01576-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01576-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T00:01:03Z","timestamp":1617408063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01576-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1576"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01576-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2020,4,3]]},"assertion":[{"value":"11 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}