{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:09Z","timestamp":1740122409816,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T00:00:00Z","timestamp":1526601600000},"content-version":"tdm","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":["11401065"],"award-info":[{"award-number":["11401065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["15IRTSTHN006"],"award-info":[{"award-number":["15IRTSTHN006"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571321","11771406"],"award-info":[{"award-number":["11571321","11771406"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10878-018-0309-3","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T01:49:33Z","timestamp":1526608173000},"page":"472-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan"],"prefix":"10.1007","volume":"36","author":[{"given":"Xing","family":"Chai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3925-9066","authenticated-orcid":false,"given":"Wenhua","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"309_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.ejor.2009.07.001","volume":"202","author":"A Agnetis","year":"2010","unstructured":"Agnetis A, Flamini M, Nicosia G, Pacifici A (2010) Scheduling three chains on two parallel machines. Eur J Oper Res 202:669\u2013674","journal-title":"Eur J Oper Res"},{"key":"309_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/PL00020913","volume":"49","author":"P Brucker","year":"1999","unstructured":"Brucker P, Hurink J, Kubiak W (1999) Scheduling identical jobs with chain precedence constraints on two uniform machines. Math Methods Oper Res 49:211\u2013219","journal-title":"Math Methods Oper Res"},{"key":"309_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0167-6377(97)00040-0","volume":"21","author":"B Chen","year":"1997","unstructured":"Chen B, Vestjens APA (1997) Scheduling on identical machines: How good is LPT in an on-line setting? Oper Res Lett 21:165\u2013169","journal-title":"Oper Res Lett"},{"key":"309_CR4","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.cor.2003.09.001","volume":"32","author":"TCE Cheng","year":"2005","unstructured":"Cheng TCE, Yuan JJ, Yang AF (2005) Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Comput Oper Res 32:849\u2013859","journal-title":"Comput Oper Res"},{"key":"309_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman Jr","year":"1972","unstructured":"Coffman EG Jr, Graham RL (1972) Optimal scheduling for two-processor systems. Acta Inf 1:200\u2013213","journal-title":"Acta Inf"},{"key":"309_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0890-5401(91)90009-Q","volume":"2","author":"JZ Du","year":"1991","unstructured":"Du JZ, Leung JYT, Young GH (1991) Scheduling chain-structured tasks to minimize makespan and mean flow time. Inf Comput 2:219\u2013236","journal-title":"Inf Comput"},{"key":"309_CR7","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu TC (1961) Parallel sequencing and assembly line problems. Oper Res 9:841\u2013848","journal-title":"Oper Res"},{"key":"309_CR8","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1137\/S0097539704444440","volume":"34","author":"YM Huo","year":"2005","unstructured":"Huo YM, Leung JYT (2005) Online scheduling of precedence constrained tasks. SIAM J Comput 34:743\u2013762","journal-title":"SIAM J Comput"},{"key":"309_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2008.03.026","volume":"401","author":"YM Huo","year":"2008","unstructured":"Huo YM, Leung JYT, Wang X (2008) Online scheduling of equal-processing-time task systems. Theor Comput Sci 401:85\u201395","journal-title":"Theor Comput Sci"},{"key":"309_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(00)00264-4","volume":"268","author":"J Noga","year":"2001","unstructured":"Noga J, Seiden SS (2001) An optimal online algorithm for scheduling two machines with release times. Theor Comput Sci 268:133\u2013143","journal-title":"Theor Comput Sci"},{"key":"309_CR11","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.tcs.2012.07.009","volume":"457","author":"JL Yuan","year":"2012","unstructured":"Yuan JL, Li WH, Yuan JJ (2012) A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. Theor Comput Sci 457:174\u2013180","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0309-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0309-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0309-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T18:12:21Z","timestamp":1693678341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0309-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,18]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["309"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0309-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,5,18]]},"assertion":[{"value":"18 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}