{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T00:12:40Z","timestamp":1768608760523,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10479-025-06961-6","type":"journal-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:23:30Z","timestamp":1764588210000},"page":"1327-1346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The online-scheduling problems with the bounded batch and incompatible job families on the unit flowshop machines"],"prefix":"10.1007","volume":"356","author":[{"given":"Xin-Gong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Hsiang","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Win-Chin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1598-5127","authenticated-orcid":false,"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,1]]},"reference":[{"key":"6961_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-019-03352-6","volume":"298","author":"X Chai","year":"2021","unstructured":"Chai, X., Li, W. H., & Zhu, Y. J. (2021). Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine. Annals of Operations Research, 298, 79\u201393.","journal-title":"Annals of Operations Research"},{"key":"6961_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"XT Deng","year":"2003","unstructured":"Deng, X. T., Poon, C. K., & Zhang, Y. Z. (2003). Approximation algorithms in batch processing. Journal of Combinatorial Optimization, 7, 247\u2013257.","journal-title":"Journal of Combinatorial Optimization"},{"key":"6961_CR3","first-page":"646","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., & Lenstra, J. K. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 646\u2013675.","journal-title":"Annals of Discrete Mathematics"},{"key":"6961_CR4","doi-asserted-by":"publisher","first-page":"1950024","DOI":"10.1142\/S0217595919500246","volume":"36","author":"CW Jiao","year":"2019","unstructured":"Jiao, C. W., Yuan, J. J., & Feng, Q. (2019). Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead. Asia-Pacific Journal of Operational Re-search, 36, 1950024.","journal-title":"Asia-Pacific Journal of Operational Re-search"},{"key":"6961_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2014.05.024","volume":"543","author":"WH Li","year":"2014","unstructured":"Li, W. H., Yuan, J. J., & Yang, S. F. (2014). Online scheduling of incompatible unit-length job families with lookahead. Theoretical Computer Science, 543, 120\u2013125.","journal-title":"Theoretical Computer Science"},{"key":"6961_CR6","doi-asserted-by":"publisher","first-page":"2240012","DOI":"10.1142\/S0217595922400127","volume":"40","author":"WH Li","year":"2023","unstructured":"Li, W. H., Wang, L. B., & Yuan, H. (2023). Online batch scheduling of incompatible job families with variable lookahead interval. Asia-pacific Journal of Operational Research, 40, 2240012.","journal-title":"Asia-pacific Journal of Operational Research"},{"key":"6961_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2022.102804","volume":"116","author":"R Lin","year":"2023","unstructured":"Lin, R., Wang, J. Q., & Oulamara, A. (2023). Online scheduling on parallel-batch machines with periodic availability constraints and job delivery. Omega, 116, Article 102804.","journal-title":"Omega"},{"issue":"8","key":"6961_CR8","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1080\/01605682.2019.1578626","volume":"72","author":"R Lin","year":"2021","unstructured":"Lin, R., Li, W. H., & Chai, X. (2021). On-line scheduling with equal-length jobs on parallel-batch machines to minimize maximum flow-time with delivery times. Journal of The Operational Research Society, 72(8), 1754\u20131761.","journal-title":"Journal of The Operational Research Society"},{"key":"6961_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ejor.2023.01.027","volume":"309","author":"R Lin","year":"2023","unstructured":"Lin, R., Wang, J. Q., Liu, Z. X., & Xu, J. (2023). Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions. European Journal of Operational Research, 309, 53\u201364.","journal-title":"European Journal of Operational Research"},{"key":"6961_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-009-0154-4","volume":"15","author":"PH Liu","year":"2009","unstructured":"Liu, P. H., Lu, X. W., & Fang, Y. (2009). A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines. Journal of Scheduling, 15, 77\u201381.","journal-title":"Journal of Scheduling"},{"key":"6961_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ijpe.2006.12.061","volume":"111","author":"QQ Nong","year":"2008","unstructured":"Nong, Q. Q., Yuan, J. J., Fu, R. Y., Lin, L., & Tian, J. (2008). The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan. International Journal of Production Economics, 111, 435\u2013440.","journal-title":"International Journal of Production Economics"},{"key":"6961_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10878-005-6855-5","volume":"9","author":"CK Poon","year":"2005","unstructured":"Poon, C. K., & Yu, W. C. (2005). On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization, 9, 167\u2013186.","journal-title":"Journal of Combinatorial Optimization"},{"key":"6961_CR13","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1016\/j.ipl.2009.08.008","volume":"109","author":"J Tian","year":"2009","unstructured":"Tian, J., Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2009). Online scheduling on unbound parallel-batch machines to minimize the makespan. Information Processing Letters, 109, 1211\u20131215.","journal-title":"Information Processing Letters"},{"key":"6961_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10878-022-00974-8","volume":"45","author":"Q Xia","year":"2023","unstructured":"Xia, Q., & Zhang, X. G. (2023). Online scheduling of two-machine flowshop with lookahead and incompatible job families. Journal of Combinatorial Optimization, 45, 50.","journal-title":"Journal of Combinatorial Optimization"},{"key":"6961_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/nav.5","volume":"48","author":"GC Zhang","year":"2001","unstructured":"Zhang, G. C., Cai, X. Q., & Wong, C. K. (2001). On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48, 241\u2013258.","journal-title":"Naval Research Logistics"},{"key":"6961_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/07408170304378","volume":"35","author":"GC Zhang","year":"2003","unstructured":"Zhang, G. C., Cai, X. Q., & Wong, C. K. (2003). Optimal online algorithms for scheduling on parallel batch processing machines. IIE Transactions, 35, 175\u2013181.","journal-title":"IIE Transactions"},{"key":"6961_CR17","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s10878-024-01242-7","volume":"49","author":"H Zhang","year":"2025","unstructured":"Zhang, H., Lu, L. F., & Yuan, J. J. (2025). Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan. Journal of Combinatorial Optimization, 49, 6.","journal-title":"Journal of Combinatorial Optimization"},{"key":"6961_CR18","doi-asserted-by":"crossref","unstructured":"Zheng, F. F., Chen, Y. H., Liu, M, & Xu, Y. F. (2024). Semi-online scheduling on two identical parallelmachines with initial-lookahead information. Asia-Pacific Journal of Operational Research, 41(1), 2350003.","DOI":"10.1142\/S0217595923500033"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06961-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06961-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06961-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T13:48:54Z","timestamp":1768571334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06961-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,1]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["6961"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06961-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,1]]},"assertion":[{"value":"30 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are none conflict of interest between authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}