{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T12:24:03Z","timestamp":1725020643287},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s11424-019-7427-6","type":"journal-article","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T05:11:07Z","timestamp":1565241067000},"page":"1180-1193","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels"],"prefix":"10.1007","volume":"32","author":[{"given":"Shuang","family":"Cai","sequence":"first","affiliation":[]},{"given":"Ke","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,8]]},"reference":[{"issue":"2","key":"7427_CR1","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff E, Parallel machine scheduling problems: A survey, Asia-Pacific Journal of Operational Research, 2001, 18(2): 193\u2013242.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"2","key":"7427_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0305-0548(94)90053-1","volume":"21","author":"P M Franca","year":"1994","unstructured":"Franca P M, Gendreau M, Laporte G, et al., A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective, Computers & operations research, 1994, 21(2): 205\u2013210.","journal-title":"Computers & operations research"},{"issue":"3-4","key":"7427_CR3","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0360-8352(97)00247-7","volume":"33","author":"R Cheng","year":"1997","unstructured":"Cheng R and Gen M, Parallel machine scheduling problems using memetic algorithms, Computers & Industrial Engineering, 1997, 33(3-4): 761\u2013764.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"7427_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z L Chen","year":"1999","unstructured":"Chen Z L and Powell W B, Solving parallel machine scheduling problems by column generation, INFORMS Journal on Computing, 1999, 11(1): 78\u201394.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"7427_CR5","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.eswa.2005.04.033","volume":"29","author":"P C Chang","year":"2005","unstructured":"Chang P C, Chen S H, and Lin K L, Two-phase sub population genetic algorithm for parallel machine-scheduling problem, Expert Systems with Applications, 2005, 29(3): 705\u2013712.","journal-title":"Expert Systems with Applications"},{"issue":"1-2","key":"7427_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0360-8352(97)00091-0","volume":"33","author":"C Grisselle","year":"1997","unstructured":"Grisselle C and Armacost R L, Parallel machine scheduling with release time and machine eligibility restrictions, Computers & Industrial Engineering, 1997, 33(1-2): 273\u2013276.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"7427_CR7","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ejor.2006.11.027","volume":"184","author":"L W Liao","year":"2008","unstructured":"Liao L W and Sheen G J, Parallel machine scheduling with machine availability and eligibility constraints, European Journal of Operational Research, 2008, 184(2): 458\u2013467.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"7427_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1080\/03052151003759117","volume":"43","author":"E B Edis","year":"2011","unstructured":"Edis E B and Ozkarahan I, A combined integer\/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions, Engineering Optimization, 2011, 43(2): 135\u2013157.","journal-title":"Engineering Optimization"},{"issue":"11","key":"7427_CR9","doi-asserted-by":"publisher","first-page":"3149","DOI":"10.1080\/00207543.2016.1265683","volume":"55","author":"C T Tseng","year":"2017","unstructured":"Tseng C T, Lee C H, Chiu Y S P, et al., A discrete electromagnetism-like mechanism for parallel machine scheduling under a grade of service provision, International Journal of Production Research, 2017, 55(11): 3149\u20133163.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"7427_CR10","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.orl.2005.11.004","volume":"34","author":"P Jongho","year":"2006","unstructured":"Jongho P, Chang S Y, and Lee K, Online and semi-online scheduling of two machines under a grade of service provision, Operations Research Letters, 2006, 34(6): 692\u2013696.","journal-title":"Operations Research Letters"},{"issue":"3","key":"7427_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1631\/jzus.2006.A0309","volume":"A7","author":"Y W Jiang","year":"2006","unstructured":"Jiang Y W, He Y, and Tang C M, Optimal online algorithms for scheduling on two identical machines under a grade of service, Journal of Zhejiang University-Science, 2006, A7(3): 309\u2013314.","journal-title":"Journal of Zhejiang University-Science"},{"issue":"1","key":"7427_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ijpe.2011.07.021","volume":"135","author":"W Yong","year":"2012","unstructured":"Yong W, Ji M, and Yang Q F, Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision, International Journal of Production Economics, 2012, 135(1): 367\u2013371.","journal-title":"International Journal of Production Economics"},{"issue":"38-40","key":"7427_CR13","doi-asserted-by":"publisher","first-page":"3597","DOI":"10.1016\/j.tcs.2009.04.007","volume":"410","author":"A Zhang","year":"2009","unstructured":"Zhang A, Jiang Y W, and Tan Z Y, Online parallel machines scheduling with two hierarchies, Theoretical Computer Science, 2009, 410(38-40): 3597\u20133605.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"7427_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10878-008-9195-4","volume":"20","author":"Z Y Tan","year":"2010","unstructured":"Tan Z Y and Zhang A, A note on hierarchical scheduling on two uniform machines, Journal of Combinatorial Optimization, 2010, 20(1): 85\u201395.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"7427_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s10878-007-9095-z","volume":"16","author":"Y W Jiang","year":"2008","unstructured":"Jiang Y W, Online scheduling on parallel machines with two GoS levels, Journal of Combinatorial Optimization, 2008, 16(1): 28\u201338.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"21-23","key":"7427_CR16","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1016\/j.tcs.2009.01.007","volume":"410","author":"M Liu","year":"2009","unstructured":"Liu M, Xu Y, Chu C, et al., Online scheduling on two uniform machines to minimize the makespan, Theoretical Computer Science, 2009, 410(21-23): 2099\u20132109.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"7427_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10951-010-0192-y","volume":"14","author":"M Marvin","year":"2011","unstructured":"Marvin M and Shabtay Dvir, Scheduling unit length jobs on parallel machines with lookahead information, Journal of Scheduling, 2011, 14(4): 335\u2013350.","journal-title":"Journal of Scheduling"},{"issue":"10","key":"7427_CR18","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1109\/12.166609","volume":"41","author":"K S Hong","year":"1992","unstructured":"Hong K S and Leung J Y T, On-line scheduling of real-time tasks, IEEE Transactions on Computers, 1992, 41(10): 1326\u20131331.","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"7427_CR19","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 and Vestjens A, Scheduling on identical machines: How good is LPT in an online setting, Operations Research Letters, 1997, 21(4): 165\u2013169.","journal-title":"Operations Research Letters"},{"issue":"1","key":"7427_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(00)00264-4","volume":"268","author":"N John","year":"2001","unstructured":"John N and Seiden S S, An optimal online algorithm for scheduling two machines with release times, Theoretical Computer Science, 2001, 268(1): 133\u2013143.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"7427_CR21","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1080\/00207540310001631584","volume":"42","author":"C Grissele","year":"2004","unstructured":"Grissele C and Armacost R L, Minimizing makespan on parallel machines with release time and machine eligibility restrictions, International Journal of Production Research, 2004, 42(6): 1243\u20131256.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"7427_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10951-010-0190-0","volume":"14","author":"K Lee","year":"2011","unstructured":"Lee K, Joseph Y T L, and Pinedo M L, Scheduling jobs with equal processing times subject to machine eligibility constraints, Journal of Scheduling, 2011, 14(1): 27\u201338.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"7427_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s40305-016-0119-1","volume":"4","author":"J Xu","year":"2016","unstructured":"Xu J and Liu Z H, An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints, Journal of the Operations Research Society of China, 2016, 4(3): 371\u2013377.","journal-title":"Journal of the Operations Research Society of China"},{"issue":"2","key":"7427_CR24","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s11424-015-3252-8","volume":"29","author":"S S Li","year":"2016","unstructured":"Li S S and Zhang Y Z, On-line scheduling on parallel machines to minimize the makespan, Journal of Systems Science and Complexity, 2016, 29(2): 472\u2013477.","journal-title":"Journal of Systems Science and Complexity"},{"key":"7427_CR25","doi-asserted-by":"crossref","unstructured":"Cai S, Liu A, and Liu K, Online scheduling of two identical machines under a grade of service provision, Control Conference (CCC), 2017 36th Chinese IEEE, 2017.","DOI":"10.23919\/ChiCC.2017.8027775"},{"issue":"6","key":"7427_CR26","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D B Shmoys","year":"1995","unstructured":"Shmoys D B, Joel W, and David P W, Scheduling parallel machines on-line, SIAM Journal on Computing, 1995, 24(6): 1313\u20131331.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"7427_CR27","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1002\/nav.20286","volume":"55","author":"J Ou","year":"2008","unstructured":"Ou J, Joseph Y T L, and Chung L L, Scheduling parallel machines with inclusive processing set restrictions, Naval Research Logistics, 2008, 55(4): 328\u2013338.","journal-title":"Naval Research Logistics"},{"issue":"44-46","key":"7427_CR28","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1016\/j.tcs.2010.08.008","volume":"411","author":"Y Huo","year":"2010","unstructured":"Huo Y and Joseph Y T L, Fast approximation algorithms for job scheduling with processing set restrictions, Theoretical Computer Science, 2010, 411(44-46): 3947\u20133955.","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-7427-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-019-7427-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-7427-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T23:15:24Z","timestamp":1596755724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-019-7427-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["7427"],"URL":"https:\/\/doi.org\/10.1007\/s11424-019-7427-6","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]},"assertion":[{"value":"15 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}