{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:40:19Z","timestamp":1758123619152},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,8]],"date-time":"2017-02-08T00:00:00Z","timestamp":1486512000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11590-017-1113-1","type":"journal-article","created":{"date-parts":[[2017,2,8]],"date-time":"2017-02-08T13:48:34Z","timestamp":1486561714000},"page":"301-310","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Online batch scheduling with kind release times and incompatible families to minimize makespan"],"prefix":"10.1007","volume":"12","author":[{"given":"Wenjie","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shisheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,8]]},"reference":[{"key":"1113_CR1","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.: The batch loading and scheduling problem. Oper. Res. 49, 52\u201365 (2001)","journal-title":"Oper. Res."},{"key":"1113_CR2","doi-asserted-by":"crossref","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.: Approximation algorithms in batch processing. J. Comb. Optim. 7, 247\u2013257 (2003)","journal-title":"J. Comb. Optim."},{"key":"1113_CR3","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tcs.2006.12.040","volume":"374","author":"RY Fu","year":"2007","unstructured":"Fu, R.Y., Tian, J., Yuan, J.J., Lin, Y.X.: On-line scheduling in a parallel batch processing system to minimize makespan using restarts. Theor. Comput. Sci. 374, 196\u2013202 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"1113_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10951-008-0084-6","volume":"12","author":"RY Fu","year":"2009","unstructured":"Fu, R.Y., Tian, J., Yuan, J.J.: On-line scheduling on an unbounded batch machine to minimize makespan of two families of jobs. J. Sched. 12, 91\u201397 (2009)","journal-title":"J. Sched."},{"key":"1113_CR5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.orl.2013.01.003","volume":"41","author":"RY Fu","year":"2013","unstructured":"Fu, R.Y., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Oper. Res. Lett. 41, 216\u2013219 (2013)","journal-title":"Oper. Res. Lett."},{"key":"1113_CR6","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.: Efficient algorithms for scheduling semi-conductor burn-in operations. Oper. Res. 40, 764\u2013775 (1992)","journal-title":"Oper. Res."},{"key":"1113_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"CY Lee","year":"1999","unstructured":"Lee, C.Y., Uzsoy, R.: Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int. J. Prod. Res. 37, 219\u2013236 (1999)","journal-title":"Int. J. Prod. Res."},{"key":"1113_CR8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s11590-015-0862-y","volume":"10","author":"WJ Li","year":"2016","unstructured":"Li, W.J., Yuan, J.J.: LPT online strategy for parallel-machine scheduling with kind release times. Optim. Lett. 10, 159\u2013168 (2016)","journal-title":"Optim. Lett."},{"key":"1113_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(00)00181-5","volume":"105","author":"ZH Liu","year":"2000","unstructured":"Liu, Z.H., Yu, W.: Scheduling one batch processor subject to job release date. Discret. Appl. Math. 105, 129\u2013136 (2000)","journal-title":"Discret. Appl. Math."},{"key":"1113_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10951-009-0154-4","volume":"15","author":"PH Liu","year":"2012","unstructured":"Liu, P.H., Lu, X.W., Fang, Y.: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines. J. Sched. 15, 77\u201381 (2012)","journal-title":"J. Sched."},{"key":"1113_CR11","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.: A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int. J. Adv. Manuf. Technol. 29, 990\u20131001 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"1113_CR12","doi-asserted-by":"crossref","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.: The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan. Int. J. Prod. Econ. 111, 435\u2013440 (2008)","journal-title":"Int. J. Prod. Econ."},{"key":"1113_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10479-004-5031-0","volume":"133","author":"CK Poon","year":"2005","unstructured":"Poon, C.K., Yu, W.C.: A flexible online scheduling algorithm for batch machine with infinite capacity. Ann. Oper. Res. 133, 175\u2013181 (2005)","journal-title":"Ann. Oper. Res."},{"key":"1113_CR14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10878-005-6855-5","volume":"9","author":"CK Poon","year":"2005","unstructured":"Poon, C.K., Yu, W.C.: On-line scheduling algorithms for a batch machine with finite capacity. J. Comb. Optim. 9, 167\u2013186 (2005)","journal-title":"J. Comb. Optim."},{"key":"1113_CR15","doi-asserted-by":"crossref","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.: Online scheduling on unbounded parallel-batch machines to minimize the makespan. Inf. Process. Lett. 109, 1211\u20131215 (2009)","journal-title":"Inf. Process. Lett."},{"key":"1113_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s40305-014-0060-0","volume":"2","author":"J Tian","year":"2014","unstructured":"Tian, J., Fu, R.Y., Yuan, J.J.: Online over time scheduling on parallel-batch machines: a survey. Oper. Res. Soc. china 2, 445\u2013454 (2014)","journal-title":"Oper. Res. Soc. china"},{"key":"1113_CR17","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10951-010-0172-2","volume":"14","author":"JJ Yuan","year":"2011","unstructured":"Yuan, J.J., Fu, R.Y., Ng, C.T., Cheng, T.C.E.: A best on-line algorithm for unbounded parallel batch scheduling to minimize makespan with restarts. J. Sched. 14, 361\u2013369 (2011)","journal-title":"J. Sched."},{"key":"1113_CR18","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1016\/j.dam.2011.01.003","volume":"159","author":"JJ Yuan","year":"2011","unstructured":"Yuan, J.J., Ng, C.T., Cheng, T.C.E.: Best semi-online algorithms for unbounded parallel batch scheduling. Discrete Appl. Math. 159, 838\u2013847 (2011)","journal-title":"Discrete Appl. Math."},{"key":"1113_CR19","doi-asserted-by":"crossref","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.: Online algorithms for minimizing makespan on batch processing machines. Nav. Res. Logist. 48, 241\u2013258 (2001)","journal-title":"Nav. Res. Logist."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1113-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1113-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1113-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T03:25:28Z","timestamp":1519269928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1113-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,8]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1113"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1113-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,8]]}}}