{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:20:34Z","timestamp":1648542034987},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s11424-013-0335-2","type":"journal-article","created":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T05:16:35Z","timestamp":1364793395000},"page":"201-208","source":"Crossref","is-referenced-by-count":0,"title":["An on-line scheduling problem of parallel machines with common maintenance time"],"prefix":"10.1007","volume":"26","author":[{"given":"Qi","family":"Feng","sequence":"first","affiliation":[]},{"given":"Wenjie","family":"Li","sequence":"additional","affiliation":[]},{"given":"Weiping","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Yuhua","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,2]]},"reference":[{"key":"335_CR1","unstructured":"Pruhs K, Sgall J, and Torng E, Online Scheduling, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ed. by Leung J Y T, Chapman & Hall\/CRC Press, Boca Raton, FL, USA, 2004."},{"key":"335_CR2","volume-title":"On-line machine scheduling","author":"A P A Vestjens","year":"1997","unstructured":"Vestjens A P A, On-line machine scheduling, Ph.D. Thesis, Eindhoven University of Technology, Netherlands, 1997."},{"issue":"2","key":"335_CR3","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S Albers","year":"1999","unstructured":"Albers S, Better bounds for online scheduling, SIAM Journal on Computing, 1999, 29(2): 459\u2013473.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"335_CR4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/S0097539702403438","volume":"32","author":"I F Rudin","year":"2003","unstructured":"Rudin III F and Chandrasekaran R, Improved bounds for the online scheduling problem, SIAM Journal on Computing, 2003, 32(3): 717\u2013735.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"335_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0304-3975(00)00260-7","volume":"268","author":"S Bischof","year":"2001","unstructured":"Bischof S and Mayr E W, On-line scheduling of parallel jobs with runtime restrictions, Theoretical Computer Science, 2001, 268(1): 67\u201390.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"335_CR6","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/moor.1040.0092","volume":"29","author":"F Anderson","year":"2004","unstructured":"Anderson F and Potts C N, Online scheduling of a single machine to minimize total weighted completion time, Mathematics of Operations Research, 2004, 29(3): 686\u2013697.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"335_CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"J A Hoogeveen","year":"2000","unstructured":"Hoogeveen J A and Vestjens A P A, A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine, SIAM Journal on Discrete Mathematics, 2000, 13(1): 56\u201363.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"335_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R L Graham","year":"1979","unstructured":"Graham R L, Lawer E L, Lenstra J K, and Rinnooy K A H G, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 1979, 5: 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"335_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","volume":"30","author":"C Y Lee","year":"1991","unstructured":"Lee C Y, Parallel machines scheduling with nonsimultaneous machine available time, Discrete Applied Mathematics, 1991, 30(1): 53\u201361.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"335_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0898-1221(98)00126-6","volume":"36","author":"H C Hwang","year":"1998","unstructured":"Hwang H C and Chang S Y, Parallel machines scheduling with machine shutdowns, Computers and Mathematics with Applications, 1998, 36(3): 21\u201331.","journal-title":"Computers and Mathematics with Applications"},{"issue":"1","key":"335_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.dam.2004.12.002","volume":"148","author":"H C Hwang","year":"2005","unstructured":"Hwang H C, Lee K, and Chang S Y, The effect of machine availability on the worst-case performance of LPT, Discrete Applied Mathematics, 2005, 148(1): 49\u201361.","journal-title":"Discrete Applied Mathematics"},{"issue":"3\u20134","key":"335_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C Y Lee","year":"1996","unstructured":"Lee C Y, Machine scheduling with an availability constraint, Journal of Global Optimization, 1996, 9(3\u20134): 395\u2013416.","journal-title":"Journal of Global Optimization"},{"issue":"9","key":"335_CR13","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R L Graham","year":"1966","unstructured":"Graham R L, Bounds for certain multiprocessing anomalies, Bell System Technical Journal, 1966, 45(9): 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"335_CR14","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle U, Kern W, and Tur\u00e1n G, On the performance of on-line algorithm for particular problem, Acta Cybernetica, 1989, 9(2): 107\u2013119.","journal-title":"Acta Cybernetica"},{"issue":"4","key":"335_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"G Woeginger","year":"1997","unstructured":"Woeginger G, A polynomial time approximation scheme for maximizing the minimum machine completion time, Operations Research Letters, 1997, 20(4): 149\u2013154.","journal-title":"Operations Research Letters"},{"issue":"7\u20138","key":"335_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0898-1221(00)00070-5","volume":"39","author":"Y He","year":"2000","unstructured":"He Y, The optimal on-line parallel machine scheduling, Computers and Mathematics with Applications, 2000, 39(7\u20138): 117\u2013121.","journal-title":"Computers and Mathematics with Applications"},{"issue":"6","key":"335_CR17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0020-0190(02)00211-9","volume":"83","author":"Z Y Tan","year":"2002","unstructured":"Tan Z Y and He Y, Optimal on-line algorithm for scheduling on two identical machines with machine availability constraints, Information Processing Letters, 2002, 83(6): 323\u2013329.","journal-title":"Information Processing Letters"},{"issue":"4","key":"335_CR18","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10288-010-0149-1","volume":"8","author":"K Lee","year":"2010","unstructured":"Lee K, Leung J Y T, and Pinedo M L, Makespan minimization in online scheduling with machine eligibility, 4OR: A Quarterly Journal of the Belgian, French, and Italian Operations Research Societies, 2010, 8(4): 331\u2013364.","journal-title":"4OR: A Quarterly Journal of the Belgian, French, and Italian Operations Research Societies"},{"issue":"4","key":"335_CR19","first-page":"1250020(1)","volume":"29","author":"Y H Cai","year":"2012","unstructured":"Cai Y H, Feng Q, and Li W J, A semi-on-line scheduling problem of two parallel machines with common maintenance time, Asia-Pacific Journal of Operational Research, 2012, 29(4): 1250020(1)\u20131250020(13).","journal-title":"Asia-Pacific Journal of Operational Research"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-013-0335-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-013-0335-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-013-0335-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:54:04Z","timestamp":1559400844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-013-0335-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["335"],"URL":"https:\/\/doi.org\/10.1007\/s11424-013-0335-2","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}