{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:19:43Z","timestamp":1772770783754,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T00:00:00Z","timestamp":1448323200000},"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":[[2017,2]]},"DOI":"10.1007\/s10878-015-9974-7","type":"journal-article","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T02:25:54Z","timestamp":1448331954000},"page":"473-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan"],"prefix":"10.1007","volume":"33","author":[{"given":"Manzhan","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinwei","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,24]]},"reference":[{"key":"9974_CR1","doi-asserted-by":"crossref","unstructured":"Bertsimas D, Gamarnik D (1999) Asymptotically optimal algorithms for job shop scheduling and packet routing. J Algorithms 33:296\u2013318","DOI":"10.1006\/jagm.1999.1047"},{"issue":"5","key":"9974_CR2","doi-asserted-by":"crossref","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 figh-multiplicity job-shop scheduling: the holding cost objective. Oper Res 51(5):798\u2013813","journal-title":"Oper Res"},{"issue":"1","key":"9974_CR3","doi-asserted-by":"crossref","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 Prog 92(1):61\u2013102","journal-title":"Math Prog"},{"key":"9974_CR4","unstructured":"Boudoukh T, Penn M, Weiss G (1998) Job-shop - an application of fluid approximation. In: Gilad I (ed) Proceedings of the tenth conference of industrial engineering and management, pp 254\u2013258"},{"key":"9974_CR5","doi-asserted-by":"crossref","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":"9974_CR6","doi-asserted-by":"crossref","first-page":"464474","DOI":"10.1287\/opre.1060.0270","volume":"54","author":"M Chou","year":"2006","unstructured":"Chou M, Liu H, Queyranne M et al (2006) On the asymptotic optimality of a simple on-line algorithm for the stochastic single-machine weighted completion time problem and its extensions. Oper Res 54:464474","journal-title":"Oper Res"},{"issue":"4","key":"9974_CR7","doi-asserted-by":"crossref","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":"4","key":"9974_CR8","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1287\/moor.1050.0166","volume":"30","author":"L Fleischer","year":"2005","unstructured":"Fleischer L, Sethuraman J (2005) Efficient algorithms for separated continuous linear programs: the multicommodity flow problem with holding costs and extensions. Math Oper Res 30(4):916\u2013938","journal-title":"Math Oper Res"},{"issue":"2","key":"9974_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"issue":"1","key":"9974_CR10","doi-asserted-by":"crossref","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":"9974_CR11","doi-asserted-by":"crossref","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. Theoret Comput Sci 495:96\u2013112","journal-title":"Theoret Comput Sci"},{"key":"9974_CR12","doi-asserted-by":"crossref","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":"9974_CR13","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10951-010-0174-0","volume":"13","author":"Y Nazarathy","year":"2009","unstructured":"Nazarathy Y, Weiss G (2009) A fluid approach to job shop scheduling: theory, software and experimentation. J Sched 13:509\u2013529","journal-title":"J Sched"},{"key":"9974_CR14","doi-asserted-by":"crossref","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":"9974_CR15","doi-asserted-by":"crossref","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"},{"issue":"1","key":"9974_CR16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10107-008-0217-x","volume":"115","author":"G Weiss","year":"2008","unstructured":"Weiss G (2008) A simplex based algorithm to solve separated continuous linear programs. Math Progr 115(1):151\u2013198","journal-title":"Math Progr"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9974-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9974-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9974-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9974-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T17:08:49Z","timestamp":1567357729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9974-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,24]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9974"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9974-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,24]]}}}