{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:13:57Z","timestamp":1773778437539,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T00:00:00Z","timestamp":1568160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T00:00:00Z","timestamp":1568160000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51675442"],"award-info":[{"award-number":["51675442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University","award":["CX201808"],"award-info":[{"award-number":["CX201808"]}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201806290125"],"award-info":[{"award-number":["201806290125"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10951-019-00623-9","type":"journal-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T10:02:35Z","timestamp":1568196155000},"page":"487-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Mixed batch scheduling on identical machines"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5244-6483","authenticated-orcid":false,"given":"Jun-Qiang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Guo-Qiang","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Zhixin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,11]]},"reference":[{"issue":"2","key":"623_CR1","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(2), 87\u2013107.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"623_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-013-0340-2","volume":"17","author":"MA Aloulou","year":"2014","unstructured":"Aloulou, M. A., Bouzaiene, A., Dridi, N., & Vanderpooten, D. (2014). A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. Journal of Scheduling, 17(1), 17\u201329.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"623_CR3","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(3), 355\u2013367.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"1","key":"623_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-007-0047-3","volume":"11","author":"MS Barketau","year":"2008","unstructured":"Barketau, M. S., Cheng, T. C. E., Ng, C. T., Kotov, V., & Kovalyov, M. Y. (2008). Batch scheduling of step deteriorating jobs. Journal of Scheduling, 11(1), 17\u201328.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"623_CR5","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., et al. (1998). Scheduling a batching machine. Journal of Scheduling, 1(1), 31\u201354.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"623_CR6","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. (1993a). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13(2), 61\u201365.","journal-title":"Operations Research Letters"},{"issue":"9","key":"623_CR7","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. (1993b). Minimizing total completion time on batch processing machines. International Journal of Production Research, 31(9), 2097\u20132121.","journal-title":"International Journal of Production Research"},{"issue":"11","key":"623_CR8","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1080\/15458830.1996.11770748","volume":"28","author":"TCE Cheng","year":"1996","unstructured":"Cheng, T. C. E., Chen, Z. L., Kovalyov, M. Y., & Lin, B. M. T. (1996). Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions, 28(11), 953\u2013956.","journal-title":"IIE Transactions"},{"issue":"5","key":"623_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(5), 413\u2013420.","journal-title":"IIE Transactions"},{"issue":"1","key":"623_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"EG Coffman","year":"1990","unstructured":"Coffman, E. G., Yannakakis, M., Magazine, M. J., & Santos, C. (1990). Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26(1), 135\u2013147.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"623_CR11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/B:JOCO.0000031415.55216.2a","volume":"8","author":"C Dang","year":"2004","unstructured":"Dang, C., & Kang, L. (2004). Batch-processing scheduling with setup times. Journal of Combinatorial Optimization, 8(2), 137\u2013146.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"06","key":"623_CR12","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1142\/S0129054102001473","volume":"13","author":"X Deng","year":"2002","unstructured":"Deng, X., Feng, H., Li, G., & Liu, G. (2002). A PTAS for minimizing total completion time of bounded batch scheduling. International Journal of Foundations of Computer Science, 13(06), 817\u2013827.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"623_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s10951-018-0586-9","volume":"22","author":"Y Gao","year":"2019","unstructured":"Gao, Y., Yuan, J. J., & Wei, Z. (2019). Unbounded parallel-batch scheduling with drop-line tasks. Journal of Scheduling, 22(4), 449\u2013463.","journal-title":"Journal of Scheduling"},{"key":"623_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"623_CR15","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.disopt.2015.02.001","volume":"16","author":"C He","year":"2015","unstructured":"He, C., Lin, H., & Lin, Y. (2015). Bounded serial-batching scheduling for minimizing maximum lateness and makespan. Discrete Optimization, 16, 70\u201375.","journal-title":"Discrete Optimization"},{"issue":"6","key":"623_CR16","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/opre.45.6.874","volume":"45","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum, D. S., & Landy, D. (1997). Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research, 45(6), 874\u2013885.","journal-title":"Operations Research"},{"issue":"2","key":"623_CR17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y Ikura","year":"1986","unstructured":"Ikura, Y., & Gimple, M. (1986). Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters, 5(2), 61\u201365.","journal-title":"Operations Research Letters"},{"issue":"4","key":"623_CR18","doi-asserted-by":"crossref","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(4), 423\u2013434.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"623_CR19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"CY Lee","year":"1999","unstructured":"Lee, C. Y. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37(1), 219\u2013236.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"623_CR20","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee, C. Y., Uzsoy, R., & Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40(4), 764\u2013775.","journal-title":"Operations Research"},{"issue":"12","key":"623_CR21","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1016\/j.ipl.2014.06.009","volume":"114","author":"SS Li","year":"2014","unstructured":"Li, S. S., & Zhang, Y. Z. (2014). Serial batch scheduling on uniform parallel machines to minimize total completion time. Information Processing Letters, 114(12), 692\u2013695.","journal-title":"Information Processing Letters"},{"key":"623_CR22","doi-asserted-by":"crossref","unstructured":"Liu, L., Wang, J., & Zhang, F. (2009). Scheduling jobs on parallel batch processing machines. In ISECS International colloquium on computing, communication, control, and management. CCCM 2009 (Vol.\u00a01, pp. 78\u201381). IEEE.","DOI":"10.1109\/CCCM.2009.5268145"},{"issue":"6","key":"623_CR23","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10951-010-0180-2","volume":"13","author":"LL 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(6), 629\u2013638.","journal-title":"Journal of scheduling"},{"issue":"1","key":"623_CR24","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.ejor.2017.09.015","volume":"266","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Lu, L., & Qi, X. (2018). Cost allocation in rescheduling with machine unavailable period. European Journal of Operational Research, 266(1), 16\u201328.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"623_CR25","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10951-014-0372-2","volume":"17","author":"Z Liu","year":"2014","unstructured":"Liu, Z., & Ro, Y. K. (2014). Rescheduling for machine disruption to minimize makespan and maximum lateness. Journal of Scheduling, 17(4), 339\u2013352.","journal-title":"Journal of Scheduling"},{"issue":"9\u201310","key":"623_CR26","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(9\u201310), 990\u20131001.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"3","key":"623_CR27","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s40305-013-0019-6","volume":"1","author":"CX Miao","year":"2013","unstructured":"Miao, C. X., Xia, Y. J., Zhang, Y. Z., & Zou, J. (2013). Batch scheduling with deteriorating jobs to minimize the total completion time. Journal of the Operations Research Society of China, 1(3), 377\u2013383.","journal-title":"Journal of the Operations Research Society of China"},{"issue":"2","key":"623_CR28","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10878-015-9980-9","volume":"33","author":"QQ Nong","year":"2017","unstructured":"Nong, Q. Q., Fan, G. Q., & Fang, Q. Z. (2017). A coordination mechanism for a scheduling game with parallel-batching machines. Journal of Combinatorial Optimization, 33(2), 567\u2013579.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"04","key":"623_CR29","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1142\/S0129054104002637","volume":"15","author":"CK Poon","year":"2004","unstructured":"Poon, C. K., & Yu, W. (2004). On minimizing total completion time in batch machine scheduling. International Journal of Foundations of Computer Science, 15(04), 593\u2013607.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"623_CR30","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(2), 228\u2013249.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"623_CR31","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1992","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1992). Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of the Operational Research Society, 43(5), 395\u2013406.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"623_CR32","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2013.08.013","volume":"233","author":"D Shabtay","year":"2014","unstructured":"Shabtay, D. (2014). The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. European Journal of Operational Research, 233(1), 64\u201374.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"623_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00240-X","volume":"133","author":"L Tang","year":"2001","unstructured":"Tang, L., Liu, J., Rong, A., & Yang, Z. (2001). A review of planning and scheduling systems and methods for integrated steel production. European Journal of Operational Research, 133(1), 1\u201320.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"623_CR34","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/TCST.2010.2060201","volume":"19","author":"L Tang","year":"2010","unstructured":"Tang, L., & Wang, X. (2010). A scatter search algorithm for a multistage production scheduling problem with blocking and semi-continuous batching machine. IEEE Transactions on Control Systems Technology, 19(5), 976\u2013989.","journal-title":"IEEE Transactions on Control Systems Technology"},{"issue":"6","key":"623_CR35","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1016\/j.omega.2007.11.003","volume":"36","author":"L Tang","year":"2008","unstructured":"Tang, L., & Zhao, Y. (2008). Scheduling a single semi-continuous batching machine. Omega, 36(6), 992\u20131004.","journal-title":"Omega"},{"issue":"7","key":"623_CR36","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615\u20131635.","journal-title":"International Journal of Production Research"},{"issue":"10","key":"623_CR37","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1080\/00207549508904839","volume":"33","author":"R Uzsoy","year":"1995","unstructured":"Uzsoy, R. (1995). Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33(10), 2685\u20132708.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"623_CR38","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.ejor.2016.10.024","volume":"258","author":"JQ Wang","year":"2017","unstructured":"Wang, J. Q., Fan, G. Q., Zhang, Y., Zhang, C. W., & Leung, J. Y. T. (2017). Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes. European Journal of Operational Research, 258(2), 478\u2013490.","journal-title":"European Journal of Operational Research"},{"key":"623_CR39","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.ijpe.2014.06.019","volume":"156","author":"JQ Wang","year":"2014","unstructured":"Wang, J. Q., & Leung, J. Y. T. (2014). Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan. International Journal of Production Economics, 156, 325\u2013331.","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"623_CR40","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(4), 692\u2013703.","journal-title":"Operations Research"},{"issue":"2","key":"623_CR41","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.ijpe.2004.04.014","volume":"105","author":"JJ Yuan","year":"2007","unstructured":"Yuan, J. J., Lin, Y. X., Cheng, T. C. E., & Ng, C. T. (2007). Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time. International Journal of Production Economics, 105(2), 402\u2013406.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"623_CR42","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang, G., Cai, X., Lee, C. Y., & Wong, C. K. (2001). Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Research Logistics, 48(3), 226\u2013240.","journal-title":"Naval Research Logistics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00623-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00623-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00623-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T18:46:41Z","timestamp":1599763601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00623-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,11]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["623"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00623-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,11]]},"assertion":[{"value":"11 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}