{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:34:00Z","timestamp":1765355640671},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,4,25]],"date-time":"2012-04-25T00:00:00Z","timestamp":1335312000000},"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":[[2013,6]]},"DOI":"10.1007\/s10951-012-0274-0","type":"journal-article","created":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T23:51:26Z","timestamp":1335311486000},"page":"261-271","source":"Crossref","is-referenced-by-count":47,"title":["Bounded parallel-batching scheduling with two competing agents"],"prefix":"10.1007","volume":"16","author":[{"given":"B. Q.","family":"Fan","sequence":"first","affiliation":[]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"S. S.","family":"Li","sequence":"additional","affiliation":[]},{"given":"Q.","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,25]]},"reference":[{"key":"274_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":"274_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":"274_CR3","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 multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"key":"274_CR4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s001860000088","volume":"52","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P. (2000). Batching identical jobs. Mathematical Methods of Operations Research, 52, 355\u2013367.","journal-title":"Mathematical Methods of Operations Research"},{"key":"274_CR5","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2006","unstructured":"Brucker, P. (2006). Scheduling algorithms (5th edn.). Berlin: Springer.","edition":"5"},{"key":"274_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. Y., Potts, C. N., Tautenhahn, T., & van\u00a0de Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31\u201354.","journal-title":"Journal of Scheduling"},{"key":"274_CR7","unstructured":"Brucker, P., & Knust, S. (2011). Complexity results for scheduling problems. http:\/\/www.mathematik.uni-osnabrueck.de\/research\/OR\/class"},{"key":"274_CR8","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1080\/00207549308956847","volume":"31","author":"V. Chandru","year":"1993","unstructured":"Chandru, V., Lee, C.-Y., & Uzsoy, R. (1993). Minimizing total completion time on batch processing machines. International Journal of Production Research, 31, 2097\u20132122.","journal-title":"International Journal of Production Research"},{"key":"274_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","volume":"13","author":"V. Chandru","year":"1993","unstructured":"Chandru, V., Lee, C.-Y., & Uzsoy, R. (1993). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13, 61\u201365.","journal-title":"Operations Research Letters"},{"key":"274_CR10","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":"274_CR11","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":"274_CR12","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"key":"274_CR13","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/opre.45.6.874","volume":"45","author":"D. S. Hochbaum","year":"1997","unstructured":"Hochbaum, D. S., & Landy, D. (1997). Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research, 45, 874\u2013885.","journal-title":"Operations Research"},{"key":"274_CR14","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. Ibarra","year":"1975","unstructured":"Ibarra, O., & Kim, C. E. (1975). Fast approximation algorithms for the Knapsack and sum of subset problems. Journal of the ACM, 22, 463\u2013468.","journal-title":"Journal of the ACM"},{"key":"274_CR15","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":"274_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"C.-Y. Lee","year":"1999","unstructured":"Lee, C.-Y., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219\u2013236.","journal-title":"International Journal of Production Research"},{"key":"274_CR17","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":"274_CR18","author":"S. S. Li","year":"2011","unstructured":"Li, S. S., & Yuan, J. J. (2011) Unbounded parallel-batching scheduling with two competitive agents. Journal of Scheduling. doi: 10.1007\/s10951-011-0253-x","journal-title":"Journal of Scheduling"},{"key":"274_CR19","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10951-010-0180-2","volume":"13","author":"L. L. Liu","year":"2010","unstructured":"Liu, L. L., Ng, C. T., & Cheng, T. C. E. (2010). On the complexity of bi-criteria scheduling on a single batch processing machine. Journal of Scheduling, 13, 629\u2013638.","journal-title":"Journal of Scheduling"},{"key":"274_CR20","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00170-009-2259-5","volume":"48","author":"P. Liu","year":"2010","unstructured":"Liu, P., Zhou, X. Y., & Tang, L. X. (2010). Two-agent single-machine scheduling with position-dependent processing times. The International Journal of Advanced Manufacturing Technology, 48, 325\u2013331.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"274_CR21","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 literature 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":"274_CR22","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":"274_CR23","doi-asserted-by":"crossref","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":"274_CR24","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 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":"274_CR25","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2011.05.041","volume":"215","author":"Q. Q. Nong","year":"2011","unstructured":"Nong, Q. Q., Cheng, T. C. E., & Ng, C. T. (2011). Two-agent scheduling to minimize the total cost. European Journal of Operational Research, 215, 39\u201344.","journal-title":"European Journal of Operational Research"},{"key":"274_CR26","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":"274_CR27","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":"274_CR28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"G. J. 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"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0274-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0274-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0274-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:47Z","timestamp":1559468387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0274-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,25]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["274"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0274-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,25]]}}}