{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T15:39:07Z","timestamp":1778513947996,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T00:00:00Z","timestamp":1522800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T00:00:00Z","timestamp":1522800000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10479-018-2839-6","type":"journal-article","created":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T14:58:00Z","timestamp":1524149880000},"page":"497-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Single-machine serial-batch delivery scheduling with two competing agents and due date assignment"],"prefix":"10.1007","volume":"298","author":[{"given":"Yunqiang","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doudou","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1617-7057","authenticated-orcid":false,"given":"Dujuan","family":"Wang","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":[[2018,4,4]]},"reference":[{"key":"2839_CR1","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":"2839_CR2","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":"2839_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.cor.2014.08.012","volume":"53","author":"F Ahmadizar","year":"2015","unstructured":"Ahmadizar, F., & Farhadi, S. (2015). Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs. Computers and Operations Research, 53, 194\u2013205.","journal-title":"Computers and Operations Research"},{"key":"2839_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.asoc.2016.06.005","volume":"47","author":"P Assarzadegan","year":"2003","unstructured":"Assarzadegan, P., & Rasti-Barzoki, M. (2003). Minimizing sum of the due date assignment costs, maximum tardiness and distribution costs in a supply chain scheduling problem. Applied Soft Computing, 47, 343\u2013356.","journal-title":"Applied Soft Computing"},{"key":"2839_CR5","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":"2839_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10479-013-1415-3","volume":"211","author":"B Bilgen","year":"2013","unstructured":"Bilgen, B., & \u00c7elebi, Y. (2013). Integrated production scheduling and distribution planning in dairy supply chain by hybrid modeling. Annals of Operations Research, 211, 55\u201382.","journal-title":"Annals of Operations Research"},{"key":"2839_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0377-2217(95)00133-6","volume":"93","author":"ZL Chen","year":"1996","unstructured":"Chen, Z. L. (1996). Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. European Journal of Operational Research, 93, 49\u201360.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2839_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"ZL Chen","year":"2010","unstructured":"Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58(1), 130\u2013148.","journal-title":"Operations Research"},{"key":"2839_CR9","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1057\/jors.1994.191","volume":"45","author":"TCE Cheng","year":"1994","unstructured":"Cheng, T. C. E., & Gordon, V. S. (1994). Batch delivery scheduling on a single machine. Journal of the Operational Research Society, 45, 1211\u20131215.","journal-title":"Journal of the Operational Research Society"},{"key":"2839_CR10","first-page":"145","volume":"10","author":"TCE Cheng","year":"1993","unstructured":"Cheng, T. C. E., & Kahlbacher, H. G. (1993). Scheduling with delivery and earliness penalty. Asia-Pacific Journal of Operational Research, 10, 145\u2013152.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"2839_CR11","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":"2839_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10479-016-2310-5","volume":"253","author":"E Gerstl","year":"2017","unstructured":"Gerstl, E., Mor, B., & Mosheiov, G. (2017). Scheduling with two competing agents to minimize total weighted earliness. Annals of Operations Research, 253, 227\u2013245.","journal-title":"Annals of Operations Research"},{"key":"2839_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V Gordon","year":"2002","unstructured":"Gordon, V., Proth, J. M., & Chu, C. (2002a). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139, 1\u201325.","journal-title":"European Journal of Operational Research"},{"key":"2839_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10951-011-0240-2","volume":"15","author":"V Gordon","year":"2012","unstructured":"Gordon, V., Strusevich, V., & Dolgui, A. (2012). Scheduling with due date assignment under special conditions on job processing. Journal of Scheduling, 15, 447\u2013456.","journal-title":"Journal of Scheduling"},{"key":"2839_CR15","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"NG Hall","year":"2003","unstructured":"Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51, 566\u2013584.","journal-title":"Operations Research"},{"key":"2839_CR16","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","volume":"70","author":"JW Hermann","year":"1993","unstructured":"Hermann, J. W., & Lee, C. Y. (1993). On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date. European Journal of Operational Research, 70, 272\u2013288.","journal-title":"European Journal of Operational Research"},{"key":"2839_CR17","first-page":"20:1","volume-title":"Handbook of scheduling: Algorithms, models and performance analysis","author":"P Kaminsky","year":"2014","unstructured":"Kaminsky, P., & Hochbaum, D. (2014). Due-date quotation models and algorithms. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis (pp. 20:1\u201320:22). Boca Raton: CRC Press."},{"key":"2839_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10951-014-0410-0","volume":"18","author":"MY Kovalyov","year":"2015","unstructured":"Kovalyov, M. Y., Oulamara, A., & Soukhal, A. (2015). Two-agent scheduling with agent specific batches on an unbounded serial batching machine. Journal of Scheduling, 18, 423\u2013434.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"2839_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/ijoc.2016.0726","volume":"29","author":"F Li","year":"2017","unstructured":"Li, F., Chen, Z. L., & Tang, L. (2017). Integrated production, inventory and delivery problems: Complexity and algorithms. INFORMS Journal on Computing, 29(2), 232\u2013250.","journal-title":"INFORMS Journal on Computing"},{"key":"2839_CR20","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.ejor.2011.06.037","volume":"215","author":"B Mor","year":"2011","unstructured":"Mor, B., & Mosheiov, G. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research, 215, 524\u2013531.","journal-title":"European Journal of Operational Research"},{"key":"2839_CR21","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1007\/s10878-016-0049-1","volume":"33","author":"B Mor","year":"2017","unstructured":"Mor, B., & Mosheiov, G. (2017). A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. Journal of the Combinatorial Optimization, 33, 1454\u20131468.","journal-title":"Journal of the Combinatorial Optimization"},{"key":"2839_CR22","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 problem with interfering and competing jobs: Multi-agent scheduling problems. European Journal of Operational Research, 235, 1\u201316.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2839_CR23","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"SK Sahni","year":"1976","unstructured":"Sahni, S. K. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23(1), 116\u2013127.","journal-title":"Journal of the ACM"},{"key":"2839_CR24","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10479-013-1522-1","volume":"217","author":"E Selvarajah","year":"2014","unstructured":"Selvarajah, E., & Zhang, R. (2014). Supply chain scheduling to minimize holding costs with outsourcing. Annals of Operations Research, 217, 479\u2013490.","journal-title":"Annals of Operations Research"},{"key":"2839_CR25","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ijpe.2009.08.012","volume":"123","author":"D Shabtay","year":"2010","unstructured":"Shabtay, D. (2010). Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs. International Journal of Production Economics, 123, 235\u2013242.","journal-title":"International Journal of Production Economics"},{"key":"2839_CR26","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10951-009-0109-9","volume":"12","author":"G Steiner","year":"2009","unstructured":"Steiner, G., & Zhang, R. (2009). Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains. Journal of Scheduling, 12, 565\u2013574.","journal-title":"Journal of Scheduling"},{"key":"2839_CR27","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1080\/00207543.2015.1056317","volume":"54","author":"D Wang","year":"2016","unstructured":"Wang, D., Yin, Y., Cheng, S. R., Cheng, T. C. E., & Wu, C. C. (2016). Due date assignment and scheduling on a single machine with two competing agents. International Journal of Production Research, 54, 1152\u20131169.","journal-title":"International Journal of Production Research"},{"key":"2839_CR28","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster, S., & Baker, K. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43, 692\u2013703.","journal-title":"Operations Research"},{"key":"2839_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G. J. (2000). When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing, 12, 57\u201375.","journal-title":"INFORMS Journal on Computing"},{"key":"2839_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2015.09.010","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Cheng, S. R., Cheng, T. C. E., Wang, D. J., & Wu, C. C. (2016a). Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega, 63, 41\u201347.","journal-title":"Omega"},{"key":"2839_CR31","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.omega.2012.06.002","volume":"41","author":"Y Yin","year":"2013","unstructured":"Yin, Y., Cheng, T. C. E., Hsu, C. J., & Wu, C. C. (2013). Single-machine batch delivery scheduling with an assignable common due window. Omega, 41, 216\u2013225.","journal-title":"Omega"},{"key":"2839_CR32","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.cie.2014.10.025","volume":"79","author":"Y Yin","year":"2015","unstructured":"Yin, Y., Cheng, T. C. E., Yang, X., & Wu, C. C. (2015). Two-agent single-machine scheduling with unrestricted due date assignment. Computers and Industrial Engineering, 79, 148\u2013155.","journal-title":"Computers and Industrial Engineering"},{"key":"2839_CR33","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1002\/nav.21700","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Wang, D., Wu, C. C., & Cheng, T. C. E. (2016b). $$CON\/SLK$$ due date assignment and scheduling on a single machine with two agents. Naval Research Logistics, 63, 416\u2013429.","journal-title":"Naval Research Logistics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2839-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2839-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2839-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T20:40:01Z","timestamp":1613248801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2839-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,4]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["2839"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2839-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,4]]},"assertion":[{"value":"4 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}