{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:16:07Z","timestamp":1772770567051,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T00:00:00Z","timestamp":1525046400000},"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 Comb Optim"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10878-018-0294-6","type":"journal-article","created":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T02:39:29Z","timestamp":1525055969000},"page":"142-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan"],"prefix":"10.1007","volume":"36","author":[{"given":"Jinwei","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manzhan","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,30]]},"reference":[{"key":"294_CR1","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1006\/jagm.1999.1047","volume":"33","author":"D Bertsimas","year":"1999","unstructured":"Bertsimas D, Gamarnik D (1999) Asymptotically optimal algorithms for job shop scheduling and packet routing. J Algorithms 33:296\u2013318","journal-title":"J Algorithms"},{"issue":"1","key":"294_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s101070100272","volume":"92","author":"D Bertsimas","year":"2002","unstructured":"Bertsimas D, Sethuraman J (2002) From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. Math Program 92(1):61\u2013102","journal-title":"Math Program"},{"issue":"5","key":"294_CR3","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1287\/opre.51.5.798.16748","volume":"51","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas D, Gamarnik D, Sethuraman J (2003) From fluid relaxations to practical algorithms for high-multiplicity job-shop scheduling: the holding cost objective. Oper Res 51(5):798\u2013813","journal-title":"Oper Res"},{"key":"294_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/jos.72","volume":"4","author":"T Boudoukh","year":"2001","unstructured":"Boudoukh T, Penn M, Weiss G (2001) Scheduling jobshops with some identical or similar jobs. J Sched 4:177\u2013199","journal-title":"J Sched"},{"key":"#cr-split#-294_CR5.1","unstructured":"Boudoukh T, Penn M, Weiss G (1998) Job-shop an application of fluid approximation. In: Gilad I"},{"key":"#cr-split#-294_CR5.2","unstructured":"(ed) Proceedings of the tenth conference of industrial engineering and management, pp 254-258, June 1998, Haifa Israel"},{"issue":"4","key":"294_CR6","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1287\/opre.50.4.692.2860","volume":"50","author":"JG Dai","year":"2002","unstructured":"Dai JG, Weiss G (2002) A fluid heuristic for minimizing makespan in job shops. Oper Res 50(4):692\u2013707","journal-title":"Oper Res"},{"issue":"1","key":"294_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-011-0985-1","volume":"191","author":"M Gu","year":"2011","unstructured":"Gu M, Lu X (2011) Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines. Ann Oper Res 191(1):97\u2013113","journal-title":"Ann Oper Res"},{"key":"294_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2013.05.035","volume":"495","author":"M Gu","year":"2013","unstructured":"Gu M, Lu X (2013) The expected asymptotical ratio for preemptive stochastic online problem. Theor Comput Sci 495:96\u2013112","journal-title":"Theor Comput Sci"},{"key":"294_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10951-014-0376-y","volume":"17","author":"M Masin","year":"2014","unstructured":"Masin M, Raviv T (2014) Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem. J Sched 17:321\u2013338","journal-title":"J Sched"},{"key":"294_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10951-010-0174-0","volume":"13","author":"Y Nazarathy","year":"2010","unstructured":"Nazarathy Y, Weiss G (2010) A fluid approach to large volume job shop scheduling. J Sched 13:509\u2013529","journal-title":"J Sched"},{"key":"294_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ejor.2007.11.039","volume":"193","author":"M Penn","year":"2009","unstructured":"Penn M, Raviv T (2009) An algorithm for the maximum revenue jobshop problem. Eur J Oper Res 193:437\u2013450","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0294-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0294-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0294-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T08:40:41Z","timestamp":1556613641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0294-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,30]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["294"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0294-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,30]]},"assertion":[{"value":"30 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}