{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:37:17Z","timestamp":1771389437096,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T00:00:00Z","timestamp":1316563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10951-011-0253-x","type":"journal-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T20:04:53Z","timestamp":1316549093000},"page":"629-640","source":"Crossref","is-referenced-by-count":64,"title":["Unbounded parallel-batching scheduling with two competitive agents"],"prefix":"10.1007","volume":"15","author":[{"given":"Shisheng","family":"Li","sequence":"first","affiliation":[]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,21]]},"reference":[{"key":"253_CR1","doi-asserted-by":"crossref","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":"253_CR2","doi-asserted-by":"crossref","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":"253_CR3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10951-008-0098-0","volume":"12","author":"A. Agnetis","year":"2009","unstructured":"Agnetis, A., Pascale, G., & Pacciarelli, D. (2009). A\u00a0Lagrangian approach to single-machine scheduling problems with two competing agents. Journal of Scheduling, 12, 401\u2013415.","journal-title":"Journal of Scheduling"},{"key":"253_CR4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K. R. Baker","year":"2003","unstructured":"Baker, K. R., & Smith, J. C. (2003). A\u00a0multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"key":"253_CR5","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin: Springer.","edition":"5"},{"key":"253_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.\u00a0Y., Potts, C.\u00a0N., Tautenhahn, T., & van\u00a0de Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31\u201354.","journal-title":"Journal of Scheduling"},{"key":"253_CR7","unstructured":"Brucker, P., & Knust, S. (2009). Complexity results of scheduling problems. http:\/\/www.informatik.uni-osnabrueck.de\/knust\/class\/ ."},{"key":"253_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"T. C. E. 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":"253_CR9","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"T. C. E. 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":"253_CR10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.49.1.52.11189","volume":"49","author":"G. Dobson","year":"2001","unstructured":"Dobson, G., & Nambimadom, R. S. (2001). The batch loading and scheduling problem. Operations Research, 49, 52\u201365.","journal-title":"Operations Research"},{"key":"253_CR11","author":"B. Q. Fan","year":"2011","unstructured":"Fan, B. Q., Yuan, J. J., & Li, S. S. (2011). Bi-criteria scheduling on a single parallel-batch machine. Applied Mathematical Modelling. doi: 10.1016\/j.apm.2011.07.084 .","journal-title":"Applied Mathematical Modelling"},{"key":"253_CR12","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C.-Y. Lee","year":"1992","unstructured":"Lee, C.-Y., Uzsoy, R., & Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semi-conductor burn-in operations. Operations Research, 40, 764\u2013775.","journal-title":"Operations Research"},{"key":"253_CR13","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"J. Y.-T. 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":"253_CR14","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/s10878-008-9163-z","volume":"19","author":"S. S. Li","year":"2010","unstructured":"Li, S. S., & Yuan, J. J. (2010). Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan. Journal of Combinatorial Optimization, 19, 84\u201393.","journal-title":"Journal of Combinatorial Optimization"},{"key":"253_CR15","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","volume":"29","author":"M. Mathirajan","year":"2006","unstructured":"Mathirajan, M., & Sivakumar, A. I. (2006). A\u00a0literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. The International Journal of Advanced Manufacturing Technology, 29, 990\u20131001.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"253_CR16","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1016\/j.ejor.2010.03.003","volume":"206","author":"B. Mor","year":"2010","unstructured":"Mor, B., & Mosheiov, G. (2010). Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. European Journal of Operational Research, 206, 540\u2013546.","journal-title":"European Journal of Operational Research"},{"key":"253_CR17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"C. T. Ng","year":"2006","unstructured":"Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2006). A\u00a0note 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":"253_CR18","first-page":"435","volume":"111","author":"Q. Q. Nong","year":"2008","unstructured":"Nong, Q. Q., Ng, C. T., & Cheng, T. C. E. (2008). The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan. Operations Research Letters, 111, 435\u2013440.","journal-title":"Operations Research Letters"},{"key":"253_CR19","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C. N. Potts","year":"2000","unstructured":"Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"253_CR20","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/1099-1425(200101\/02)4:1<25::AID-JOS58>3.0.CO;2-7","volume":"4","author":"C. N. Potts","year":"2001","unstructured":"Potts, C. N., Strusevich, V. A., & Tautenhahn, T. (2001). Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4, 25\u201351.","journal-title":"Journal of Scheduling"},{"key":"253_CR21","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.apm.2009.04.007","volume":"34","author":"M. T. Y. Sabouni","year":"2010","unstructured":"Sabouni, M. T. Y., & Jolai, F. (2010). Optimal methods for batch processing problem with makespan and maximum lateness objectives. Applied Mathematical Modelling, 34, 314\u2013324.","journal-title":"Applied Mathematical Modelling"},{"key":"253_CR22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0167-6377(00)00040-7","volume":"27","author":"A. P. M. Wagelmans","year":"2000","unstructured":"Wagelmans, A. P. M., & Gerodimos, A. E. (2000). Improved dynamic programs for some batching problems involving the maximum lateness criterion. Operations Research Letters, 27, 109\u2013118.","journal-title":"Operations Research Letters"},{"key":"253_CR23","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ejor.2010.01.005","volume":"205","author":"G. Wan","year":"2010","unstructured":"Wan, G., Vakati, S. R., Leung, J. Y.-T., & Pinedo, M. (2010). Scheduling two agents with controllable processing times. European Journal of Operational Research, 205, 528\u2013539.","journal-title":"European Journal of Operational Research"},{"key":"253_CR24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.tcs.2004.01.038","volume":"320","author":"J. J. Yuan","year":"2004","unstructured":"Yuan, J. J., Liu, Z. H., Ng, C. T., & Cheng, T. C. E. (2004). The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theoretical Computer Science, 320, 199\u2013212.","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0253-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0253-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0253-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:46Z","timestamp":1559468386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0253-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,21]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["253"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0253-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,21]]}}}