{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:12:22Z","timestamp":1771877542947,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,12,18]],"date-time":"2014-12-18T00:00:00Z","timestamp":1418860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10951-014-0410-0","type":"journal-article","created":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T05:50:18Z","timestamp":1418795418000},"page":"423-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Two-agent scheduling with agent specific batches on an unbounded serial batching machine"],"prefix":"10.1007","volume":"18","author":[{"given":"Mikhail Y.","family":"Kovalyov","sequence":"first","affiliation":[]},{"given":"Ammar","family":"Oulamara","sequence":"additional","affiliation":[]},{"given":"Ameur","family":"Soukhal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,18]]},"reference":[{"key":"410_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1009637419820","volume":"6","author":"A Agnetis","year":"2000","unstructured":"Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2000). Nondominated schedules for a job-shop with two competing users. Computational & Mathematical Organization Theory, 6, 191\u2013217.","journal-title":"Computational & Mathematical Organization Theory"},{"key":"410_CR2","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":"410_CR3","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":"410_CR4","unstructured":"Agnetis, A., Pacciarelli, D. & Pacifici, A. (2008). Combinatorial models for multi agent scheduling problems, In E. Levner (Eds.) Multiprocessor scheduling, theory and applications (pp. 21\u201346). Vienna, Austria: I-Tech Education and Publishing. ISBN 978-3-902613-02-8."},{"key":"410_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"S Albers","year":"1993","unstructured":"Albers, S., & Brucker, P. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87\u2013107.","journal-title":"Discrete Applied Mathematics"},{"key":"410_CR6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K Baker","year":"2003","unstructured":"Baker, K., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"key":"410_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2008.10.038","volume":"199","author":"H Balasubramanian","year":"2009","unstructured":"Balasubramanian, H., Fowler, J., Keha, A., & Pfund, M. (2009). Scheduling interfering job sets on parallel machines. European Journal of Operational Research, 199, 55\u201367.","journal-title":"European Journal of Operational Research"},{"key":"410_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01303431","volume":"43","author":"P Brucker","year":"1996","unstructured":"Brucker, P., & Kovalyov, M. Y. (1996). Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research, 43, 1\u20138.","journal-title":"Mathematical Methods of Operations Research"},{"key":"410_CR9","first-page":"413","volume":"33","author":"TCE Cheng","year":"2001","unstructured":"Cheng, T. C. E., & Kovalyov, M. Y. (2001). Single machine batch scheduling with sequential job processing. IIE Transactions, 33, 413\u2013420.","journal-title":"IIE Transactions"},{"key":"410_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1080\/07408170490247368","volume":"36","author":"TCE Cheng","year":"2004","unstructured":"Cheng, T. C. E., Kovalyov, M. Y., & Chakhlevich, K. N. (2004). Batching in a two-stage flowshop with dedicated machines in the second stage. IIE Transactions, 36, 87\u201393.","journal-title":"IIE Transactions"},{"key":"410_CR11","doi-asserted-by":"crossref","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":"410_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"EG Coffman Jr","year":"1990","unstructured":"Coffman, E. G, Jr, Yannakakis, M., Magazine, M. J., & Santos, C. A. (1990). Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26, 135\u2013147.","journal-title":"Annals of Operations Research"},{"key":"410_CR13","unstructured":"Feng, Q., Yu, Z., & Shang W. (2011). Pareto optimization of serial-batching scheduling problems on two agents. In International conference on advanced mechatronic systems, ICAMechS 2011 (pp. 165\u2013168). Final Program, art. no. 6025008."},{"key":"410_CR14","doi-asserted-by":"crossref","unstructured":"Gavranovic, H. & Finke, G. (2000). Graph partitioning and set covering for optimal design of production system in the metal industry. In Proceedings of the second conference on management and control of production and logistics\u2014MCPL\u201900, Grenobl.","DOI":"10.1016\/S1474-6670(17)39472-7"},{"key":"410_CR15","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.13.2.120.10521","volume":"13","author":"CA Glass","year":"2001","unstructured":"Glass, C. A., Potts, C. N., & Strusevich, V. A. (2001). Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13, 120\u2013137.","journal-title":"INFORMS Journal on Computing"},{"key":"410_CR16","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1287\/opre.1030.0101","volume":"52","author":"NG Hall","year":"2004","unstructured":"Hall, N. G., & Potts, C. N. (2004). Rescheduling for new orders. Operations Research, 52, 440\u2013453.","journal-title":"Operations Research"},{"key":"410_CR17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(94)90063-9","volume":"16","author":"DS Hochbaum","year":"1994","unstructured":"Hochbaum, D. S., & Landy, D. (1994). Scheduling with batching: Minimizing the weighted number of tardy jobs. Operations Research Letters, 16, 79\u201386.","journal-title":"Operations Research Letters"},{"key":"410_CR18","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"J Hoogeveen","year":"2005","unstructured":"Hoogeveen, J. (2005). Multicriteria scheduling. European Journal of Operational Research, 167, 592\u2013623.","journal-title":"European Journal of Operational Research"},{"key":"410_CR19","doi-asserted-by":"crossref","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(3), 311\u2013321.","DOI":"10.1007\/s10951-011-0252-y"},{"key":"410_CR20","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0377-2217(03)00250-9","volume":"157","author":"MY Kovalyov","year":"2004","unstructured":"Kovalyov, M. Y., Potts, C. N., & Strusevich, V. A. (2004). Batching decisions for assembly production systems. European Journal of Operational Research, 157, 620\u2013642.","journal-title":"European Journal of Operational Research"},{"key":"410_CR21","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/opre.1060.0301","volume":"54","author":"MA Kubzin","year":"2006","unstructured":"Kubzin, M. A., & Strusevich, V. A. (2006). Planning machine maintenance in two-machne shop scheduling. Operations Research, 54, 789\u2013800.","journal-title":"Operations Research"},{"key":"410_CR22","doi-asserted-by":"crossref","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":"410_CR23","unstructured":"Li, S., Cheng, T. C. E., Ng, C. T., & Yuan, J. (2014). Two-agent scheduling on a single batching machine. Discrete Applied Mathematics (submitted)."},{"key":"410_CR24","doi-asserted-by":"crossref","unstructured":"Li, S., & Yuan, J. (2012). Unbounded parallel-batching scheduling with two competitive agents. Journal of Scheduling, 15(5), 629\u2013640.","DOI":"10.1007\/s10951-011-0253-x"},{"key":"410_CR25","doi-asserted-by":"crossref","unstructured":"Mor, B., & Mosheiov, G. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research, 215(3), 524\u2013531.","DOI":"10.1016\/j.ejor.2011.06.037"},{"key":"410_CR26","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.cor.2007.10.006","volume":"36","author":"A Oulamara","year":"2009","unstructured":"Oulamara, A., Finke, G., & Kamgaing Kuiten, A. (2009). Flowshop scheduling problem with batching machine and task compatibilities. Computers & Operations Research, 36, 391\u2013401.","journal-title":"Computers & Operations Research"},{"key":"410_CR27","first-page":"685","volume":"37","author":"A Oulamara","year":"2005","unstructured":"Oulamara, A., Kovalyov, M. Y., & Finke, G. (2005). Scheduling a no-wait flowshop with unbounded batching machines. IIE Transactions on Scheduling and Logistics, 37, 685\u2013696.","journal-title":"IIE Transactions on Scheduling and Logistics"},{"key":"410_CR28","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN 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":"410_CR29","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"42","author":"CN Potts","year":"1992","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1992). Integrating scheduling with batching and lotsizing: A review of algorithms and complexity. Journal of the Operational Research Society, 42, 395\u2013406.","journal-title":"Journal of the Operational Research Society"},{"key":"410_CR30","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.aei.2006.05.004","volume":"20","author":"W Shen","year":"2006","unstructured":"Shen, W., Hao, Q., Joong Yoon, H., & Norrie, D. H. (2006). Applications of agent-based systems in intelligent manufacturing: An updated review. Advanced Engineering Informatics, 20, 415\u2013431.","journal-title":"Advanced Engineering Informatics"},{"key":"410_CR31","doi-asserted-by":"crossref","unstructured":"Tan, Q., Chen, H.-P., Du, B. & Li, X.-L. (2011) Two-agent scheduling on a single batch processing machine with non-identical job sizes. In 2nd international conference on artificial intelligence, management science and electronic commerce, AIMSEC 2011. Proceedings, art. no. 6009883 (pp. 7431\u20137435).","DOI":"10.1109\/AIMSEC.2011.6009883"},{"key":"410_CR32","volume-title":"Multicriteria scheduling: Theory, models and algorithms","author":"V T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling: Theory, models and algorithms (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"410_CR33","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1111\/j.1937-5956.1997.tb00415.x","volume":"6","author":"R Uzsoy","year":"1997","unstructured":"Uzsoy, R., & Yang, Y. (1997). Minimizing total weighted completion time on a single batch processing machine. Production and Operations Management, 6, 57\u201373.","journal-title":"Production and Operations Management"},{"key":"410_CR34","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster, S., & Baker, K. R. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43, 692\u2013704.","journal-title":"Operations Research"},{"issue":"2","key":"410_CR35","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.apm.2009.04.007","volume":"34","author":"MT Yazdani Sabouni","year":"2010","unstructured":"Yazdani Sabouni, M. T., & Jolai, F. (2010). Optimal methods for batch processing problem with makespan and maximum lateness objectives. Applied Mathematical Modelling, 34(2), 314\u2013324.","journal-title":"Applied Mathematical Modelling"},{"key":"410_CR36","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10951-005-4997-z","volume":"8","author":"JJ Yuan","year":"2005","unstructured":"Yuan, J. J., Shang, W. P., & Feng, Q. (2005). A note on the scheduling with two families of jobs. Journal of Scheduling, 8, 537\u2013542.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0410-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0410-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0410-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:39:43Z","timestamp":1747197583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0410-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,18]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["410"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0410-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,18]]}}}