{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T00:53:11Z","timestamp":1722559991604},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T00:00:00Z","timestamp":1188864000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10288-007-0053-5","type":"journal-article","created":{"date-parts":[[2007,9,3]],"date-time":"2007-09-03T20:05:20Z","timestamp":1188849920000},"page":"375-392","source":"Crossref","is-referenced-by-count":15,"title":["Maximizing the minimum completion time on parallel machines"],"prefix":"10.1007","volume":"6","author":[{"given":"Mohamed","family":"Haouari","sequence":"first","affiliation":[]},{"given":"Mahdi","family":"Jemmali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,4]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-63397-9_3","volume":"1284","author":"Y Azar","year":"1997","unstructured":"Azar Y, Epstein L (1997) On-line machine covering. Lect Notes Comput Sci 1284:23\u201336","journal-title":"Lect Notes Comput Sci"},{"key":"53_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0167-6377(92)90004-M","volume":"11","author":"J Csirik","year":"1992","unstructured":"Csirik J, Kellerer H, Woeginger G (1992) The exact LPT-bound for maximizing the minimum completion time. Oper Res Lett 11:281\u2013287","journal-title":"Oper Res Lett"},{"key":"53_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7:191\u2013200","journal-title":"ORSA J Comput"},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"BL Deuermeyer","year":"1982","unstructured":"Deuermeyer BL, Friesen DK, Langston MA (1982) Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J Algorithms Discret Methods 3:190\u2013196","journal-title":"SIAM J Algorithms Discret Methods"},{"key":"53_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/B:ANOR.0000030688.31785.40","volume":"129","author":"M Haouari","year":"2004","unstructured":"Haouari M, Gharbi A (2004) Lower bounds for scheduling on identical parallel machines with heads and tails. Ann Oper Res 129:187\u2013204","journal-title":"Ann Oper Res"},{"key":"53_CR6","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1111\/j.1475-3995.2006.00562.x","volume":"13","author":"M Haouari","year":"2006","unstructured":"Haouari M, Gharbi A, Jemmali M (2006) Tight bounds for the identical parallel machine scheduling problem. Int Trans Oper Res 13:529\u2013548","journal-title":"Int Trans Oper Res"},{"key":"53_CR7","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys D (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SS, Rinnooy Kan AHG, Zipkin P (eds) Handbooks in operations research and management science, vol 4, pp 445\u2013522"},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s00453-002-0989-y","volume":"35","author":"D Pisinger","year":"2003","unstructured":"Pisinger D (2003) Dynamic programming on the word RAM. Algorithmica 35:437\u2013459","journal-title":"Algorithmica"},{"key":"53_CR9","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"HD Sherali","year":"2001","unstructured":"Sherali HD, Smith JC (2001) Improving discrete model representations via symmetry considerations. Manage Sci 47:1396\u20131407","journal-title":"Manage Sci"},{"key":"53_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1013855712183","volume":"6","author":"ZY Tan","year":"2002","unstructured":"Tan ZY, He Y (2002) Ordinal on-line scheduling for maximizing the minimum machine completion time. J Comb Optim 6:199\u2013206","journal-title":"J Comb Optim"},{"key":"53_CR11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger GJ (1997) A polynomial time approximation scheme for maximizing the minimum completion time. Oper Res Lett 20:149\u2013154","journal-title":"Oper Res Lett"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0053-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0053-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0053-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:55Z","timestamp":1559131975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0053-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,4]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0053-5","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,4]]}}}