{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T10:58:00Z","timestamp":1771757880440,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Key Research Projects of Henan Higher Education Institutions","award":["20A110037"],"award-info":[{"award-number":["20A110037"]}]},{"name":"Young Backbone Teachers training program of Zhongyuan University of Technology","award":["2018XQG15"],"award-info":[{"award-number":["2018XQG15"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10951-023-00779-5","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T18:02:47Z","timestamp":1679940167000},"page":"227-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Competitive two-agent scheduling with release dates and preemption on a single machine"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3197-1558","authenticated-orcid":false,"given":"Shi-Sheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren-Xia","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,27]]},"reference":[{"key":"779_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., & Souhal, A. (2014). Multiagent scheduling: Models and algorithms. Berlin: Springer."},{"key":"779_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ejor.2018.12.048","volume":"276","author":"A Agnetis","year":"2019","unstructured":"Agnetis, A., Chen, B., Nicosia, G., & Pacifici, A. (2019). Price of fairness in two-agent single-machine scheduling problems. European Journal of Operational Research, 276, 79\u201387.","journal-title":"European Journal of Operational Research"},{"key":"779_CR3","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. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229\u2013242.","journal-title":"Operations Research"},{"key":"779_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","volume":"150","author":"A Agnetis","year":"2007","unstructured":"Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150, 3\u201315.","journal-title":"Annals of Operations Research"},{"key":"779_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/opre.31.2.381","volume":"31","author":"KR Baker","year":"1983","unstructured":"Baker, K. R., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1983). Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research, 31, 381\u2013386.","journal-title":"Operations Research"},{"key":"779_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"key":"779_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2, 245\u2013252.","journal-title":"Journal of Scheduling"},{"key":"779_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0166-218X(99)00238-3","volume":"103","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103, 21\u201332.","journal-title":"Discrete Applied Mathematics"},{"key":"779_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.orl.2003.09.004","volume":"32","author":"P Baptiste","year":"2004","unstructured":"Baptiste, P., Chrobak, M., Durr, C., Jawor, W., & Vakhania, N. (2004). Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operations Research Letters, 32, 258\u2013264.","journal-title":"Operations Research Letters"},{"key":"779_CR10","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin: Springer.","edition":"5"},{"key":"779_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0676-1","volume-title":"Hard real-time computing systems: Predictable scheduling algorithms and applications","author":"GC Buttazzo","year":"2011","unstructured":"Buttazzo, G. C. (2011). Hard real-time computing systems: Predictable scheduling algorithms and applications (3rd ed.). New York: Springer.","edition":"3"},{"key":"779_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11, 42\u201347.","journal-title":"European Journal of Operational Research"},{"key":"779_CR13","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.ejor.2021.10.064","volume":"301","author":"RB Chen","year":"2022","unstructured":"Chen, R. B., Geng, Z. C., Lu, L. F., Yuan, J. J., & Zhang, Y. (2022). Pareto-scheduling of two competing agents with their own equal processing times. European Journal of Operational Research, 301, 414\u2013431.","journal-title":"European Journal of Operational Research"},{"key":"779_CR14","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10951-018-0598-5","volume":"22","author":"RB Chen","year":"2019","unstructured":"Chen, R. B., Yuan, J. J., & Gao, Y. (2019). The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. Journal of Scheduling, 22, 581\u2013593.","journal-title":"Journal of Scheduling"},{"key":"779_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"TCE Cheng","year":"2006","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273\u2013281.","journal-title":"Theoretical Computer Science"},{"key":"779_CR16","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"TCE Cheng","year":"2008","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188, 603\u2013609.","journal-title":"European Journal of Operational Research"},{"key":"779_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-15621-2_28","volume":"6328","author":"G Ding","year":"2010","unstructured":"Ding, G., & Sun, S. (2010). Single-machine scheduling problems with two agents competing for makespan. Lecture Notes in Computer Science, 6328, 244\u2013255.","journal-title":"Lecture Notes in Computer Science"},{"key":"779_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10479-015-2054-7","volume":"238","author":"O Dover","year":"2016","unstructured":"Dover, O., & Shabtay, D. (2016). Single machine scheduling with two competing agents, arbitrary release dates and unit processing times. Annals of Operations Research, 238, 145\u2013178.","journal-title":"Annals of Operations Research"},{"key":"779_CR19","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is $${{\\cal{N} }}{{\\cal{P} }}$$-hard. Mathematics of Operations Research, 15, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"779_CR20","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10951-010-0201-1","volume":"14","author":"D Elvikis","year":"2011","unstructured":"Elvikis, D., Hamacher, H. W., & T\u2019kindt, V. (2011). Scheduling two agents on uniform parallel machines with makespan and cost functions. Journal of Scheduling, 14, 471\u2013481.","journal-title":"Journal of Scheduling"},{"key":"779_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-012-1099-0","volume":"213","author":"D Elvikis","year":"2014","unstructured":"Elvikis, D., & T\u2019kindt, V. (2014). Two-agent scheduling on uniform machines with min-max criteria. Annals of Operations Research, 213, 79\u201394.","journal-title":"Annals of Operations Research"},{"key":"779_CR22","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s11590-020-01576-1","volume":"15","author":"Y Gao","year":"2021","unstructured":"Gao, Y., Yuan, J. J., Ng, C. T., & Cheng, T. C. E. (2021). A note on competing-agent Pareto-scheduling. Optimization Letters, 15, 249\u2013262.","journal-title":"Optimization Letters"},{"key":"779_CR23","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. (2015). Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness. Theoretical Computer Science, 570, 22\u201329.","journal-title":"Theoretical Computer Science"},{"key":"779_CR24","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/jos.85","volume":"4","author":"BD Gupta","year":"2001","unstructured":"Gupta, B. D., & Palis, M. A. (2001). Online real-time preemptive scheduling of jobs with deadlines on multiple machines. Journal of Scheduling, 4, 297\u2013312.","journal-title":"Journal of Scheduling"},{"key":"779_CR25","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.tifs.2021.01.066","volume":"109","author":"JW Han","year":"2021","unstructured":"Han, J. W., Zuo, M., Zhu, W. Y., Zuo, J. H., L\u00fc, E. L., & Yang, X. T. (2021). A comprehensive review of cold chain logistics for fresh agricultural products: Current status, challenges, and future trends. Trends in Food Science & Technology, 109, 536\u2013551.","journal-title":"Trends in Food Science & Technology"},{"key":"779_CR26","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10878-021-00697-2","volume":"41","author":"RY He","year":"2021","unstructured":"He, R. Y., Yuan, J. J., Ng, C. T., & Cheng, T. C. E. (2021). Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. Journal of Combinatorial Optimization, 41, 504\u2013525.","journal-title":"Journal of Combinatorial Optimization"},{"key":"779_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.omega.2018.08.001","volume":"83","author":"D Hermelin","year":"2019","unstructured":"Hermelin, D., Kubitza, J. M., Shabtay, D., Talmon, N., & Woeginger, G. J. (2019). Scheduling two agents on a single machine: A parameterized analysis of NP-hard problems. Omega, 83, 275\u2013286.","journal-title":"Omega"},{"key":"779_CR28","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, 592\u2013623.","journal-title":"European Journal of Operational Research"},{"key":"779_CR29","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"WA Horn","year":"1974","unstructured":"Horn, W. A. (1974). Some simple scheduling algorithms. Naval Research Logistics Quarterly, 21, 177\u2013185.","journal-title":"Naval Research Logistics Quarterly"},{"key":"779_CR30","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10951-011-0252-y","volume":"15","author":"N Huynh-Tuong","year":"2012","unstructured":"Huynh-Tuong, N., Soukhal, A., & Billaut, J. C. (2012). Single-machine multi-agent scheduling problems with a global objective function. Journal of Scheduling, 15, 311\u2013321.","journal-title":"Journal of Scheduling"},{"key":"779_CR31","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations. New York: Plenum Press."},{"key":"779_CR32","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00453-008-9248-1","volume":"57","author":"H Kellerer","year":"2010","unstructured":"Kellerer, H., & Strusevich, V. A. (2010). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57, 769\u2013795.","journal-title":"Algorithmica"},{"key":"779_CR33","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10951-019-00613-x","volume":"22","author":"MY Kovalyov","year":"2019","unstructured":"Kovalyov, M. Y., & S\u0306es\u0306ok, D. (2019). Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: Refining computational complexity. Journal of Scheduling, 22, 603\u2013606.","journal-title":"Journal of Scheduling"},{"key":"779_CR34","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10951-011-0231-3","volume":"14","author":"SA Kravchenko","year":"2011","unstructured":"Kravchenko, S. A., & Werner, F. (2011). Parallel machine problems with equal processing times: A survey. Journal of Scheduling, 14, 435\u2013444.","journal-title":"Journal of Scheduling"},{"key":"779_CR35","first-page":"245","volume-title":"Preemptive scheduling of uniform machines subject to release dates. Progress in combinatorial optimization","author":"J Labetoulle","year":"1984","unstructured":"Labetoulle, J., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1984). Preemptive scheduling of uniform machines subject to release dates. Progress in combinatorial optimization (pp. 245\u2013261). Toronto: Academic Press."},{"key":"779_CR36","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"EL Lawler","year":"1990","unstructured":"Lawler, E. L. (1990). A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research, 26, 125\u2013133.","journal-title":"Annals of Operations Research"},{"key":"779_CR37","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","volume":"20","author":"EL Lawler","year":"1994","unstructured":"Lawler, E. L. (1994). Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the \u2018tower of set\u2019 property. Mathematical and Computer Modelling, 20, 91\u2013106.","journal-title":"Mathematical and Computer Modelling"},{"key":"779_CR38","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 application to resource allocation and sequencing problems. Management Science, 16, 77\u201384.","journal-title":"Management Science"},{"key":"779_CR39","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, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"779_CR40","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung, J. Y. T., Pinedo, M., & Wan, G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58, 458\u2013469.","journal-title":"Operations Research"},{"key":"779_CR41","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1002\/nav.21779","volume":"64","author":"SS Li","year":"2017","unstructured":"Li, S. S., Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2017). Two-agent scheduling on a single sequential and compatible batching machine. Naval Research Logistics, 64, 628\u2013641.","journal-title":"Naval Research Logistics"},{"key":"779_CR42","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10951-020-00646-7","volume":"23","author":"SS Li","year":"2020","unstructured":"Li, S. S., & Yuan, J. J. (2020). Single-machine scheduling with multi-agents to minimize total weighted late work. Journal of Scheduling, 23, 497\u2013512.","journal-title":"Journal of Scheduling"},{"key":"779_CR43","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"14","author":"JM Moore","year":"1968","unstructured":"Moore, J. M. (1968). An $$n$$ Job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 14, 102\u2013109.","journal-title":"Management Science"},{"key":"779_CR44","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"CT Ng","year":"2006","unstructured":"Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2006). A note on the complexity of the problem of two-agent scheduling on a single machine. Journal of Combinatorial Optimization, 12, 387\u2013394.","journal-title":"Journal of Combinatorial Optimization"},{"key":"779_CR45","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. (2015). Single machine scheduling with two competing agents and equal job processing times. European Journal of Operational Research, 244, 86\u201399.","journal-title":"European Journal of Operational Research"},{"key":"779_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.09.017","volume":"235","author":"P Perez-Gonzalez","year":"2014","unstructured":"Perez-Gonzalez, P., & Framinan, J. M. (2014). A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. European Journal of Operational Research, 235, 1\u201316.","journal-title":"European Journal of Operational Research"},{"key":"779_CR47","doi-asserted-by":"crossref","unstructured":"Simons, B. (1978). A fast algorithm for single processor scheduling. In Proc. IEEE 19th annual symposium on foundations of computer science (FOCS\u201978) (pp. 246\u2013252).","DOI":"10.1109\/SFCS.1978.4"},{"key":"779_CR48","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1023\/A:1014971620268","volume":"107","author":"F Sourd","year":"2001","unstructured":"Sourd, F. (2001). Preemptive scheduling with two minimax criteria. Annals of Operations Research, 107, 303\u2013319.","journal-title":"Annals of Operations Research"},{"key":"779_CR49","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10951-006-7039-6","volume":"9","author":"Z Tian","year":"2006","unstructured":"Tian, Z., Ng, C. T., & Cheng, T. C. E. (2006). An $$O(n^2)$$ algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. Journal of Scheduling, 9, 343\u2013364.","journal-title":"Journal of Scheduling"},{"key":"779_CR50","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2020.07.064","volume":"290","author":"L Wan","year":"2021","unstructured":"Wan, L., Mei, J. J., & Du, J. Z. (2021). Two-agent scheduling of unit processing time to minimize total weighted completion time and total weighted number of tardy jobs. European Journal of Operational Research, 290, 26\u201335.","journal-title":"European Journal of Operational Research"},{"key":"779_CR51","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10951-014-0368-y","volume":"18","author":"L Wan","year":"2015","unstructured":"Wan, L., Yuan, J. J., & Geng, Z. C. (2015). A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints. Journal of Scheduling, 18, 315\u2013323.","journal-title":"Journal of Scheduling"},{"key":"779_CR52","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.amc.2015.10.059","volume":"273","author":"L Wan","year":"2016","unstructured":"Wan, L., Yuan, J. J., & Wei, L. (2016). Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost. Applied Mathematics and Computation, 273, 912\u2013923.","journal-title":"Applied Mathematics and Computation"},{"key":"779_CR53","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10951-018-0583-z","volume":"22","author":"Y Yin","year":"2019","unstructured":"Yin, Y., Chen, Y., Qin, K., & Wan, D. (2019). Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria. Journal of Scheduling, 22, 315\u2013333.","journal-title":"Journal of Scheduling"},{"key":"779_CR54","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1504\/IJSTL.2013.050590","volume":"5","author":"Y Yin","year":"2013","unstructured":"Yin, Y., Cheng, S. R., Cheng, T. C. E., Wu, W. H., & Wu, C. C. (2013). Two-agent single-machine scheduling with release times and deadlines. International Journal of Shipping and Transport Logistics, 5, 75\u201394.","journal-title":"International Journal of Shipping and Transport Logistics"},{"key":"779_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2105-8","volume-title":"Due date-related scheduling with two agents: Models and algorithms","author":"Y Yin","year":"2020","unstructured":"Yin, Y., Wang, D., & Cheng, T. C. E. (2020). Due date-related scheduling with two agents: Models and algorithms. Singapore: Springer."},{"key":"779_CR56","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10951-013-0360-y","volume":"18","author":"JJ Yuan","year":"2015","unstructured":"Yuan, J. J., Ng, C. T., & Cheng, T. C. E. (2015). Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. Journal of Scheduling, 18, 147\u2013153.","journal-title":"Journal of Scheduling"},{"key":"779_CR57","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1016\/j.ejor.2019.07.072","volume":"280","author":"JJ Yuan","year":"2020","unstructured":"Yuan, J. J., Ng, C. T., & Cheng, T. C. E. (2020). Scheduling with release dates and preemption to minimize multiple max-form objective functions. European Journal of Operational Research, 280, 860\u2013875.","journal-title":"European Journal of Operational Research"},{"key":"779_CR58","doi-asserted-by":"crossref","unstructured":"Zhang, Y., & Yuan, J. J. (2019). A note on a two-agent scheduling problem related to the total weighted late work. Journal of Combinatorial Optimization, 37, 989\u2013999.","DOI":"10.1007\/s10878-018-0337-z"},{"key":"779_CR59","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10878-019-00507-w","volume":"39","author":"QL Zhao","year":"2020","unstructured":"Zhao, Q. L., & Yuan, J. J. (2020). Bicriteria scheduling of equal length jobs on uniform parallel machines. Journal of Combinatorial Optimization, 39, 637\u2013661.","journal-title":"Journal of Combinatorial Optimization"},{"key":"779_CR60","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/TC.1987.5009518","volume":"36","author":"W Zhao","year":"1987","unstructured":"Zhao, W., Ramamritham, K., & Stankovic, J. A. (1987). Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, 36, 949\u2013960.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00779-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00779-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00779-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T03:31:41Z","timestamp":1686195101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00779-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,27]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["779"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00779-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,27]]},"assertion":[{"value":"20 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}