{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:09:02Z","timestamp":1773148142887,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1023\/a:1013370208101","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T21:46:14Z","timestamp":1040679974000},"page":"67-80","source":"Crossref","is-referenced-by-count":7,"title":["3-Partitioning Problems for Maximizing the Minimum Load"],"prefix":"10.1007","volume":"6","author":[{"given":"Shi Ping","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"389759_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01193837","volume":"47","author":"L. Babel","year":"1998","unstructured":"L. Babel, H. Kellerer, and V. Kotov, \u201cThe k-partitioning problem,\u201d Mathematical Methods of Operations Research, vol. 47, pp. 59\u201382, 1998.","journal-title":"Mathematical Methods of Operations Research"},{"key":"389759_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(99)00049-9","volume":"92","author":"S.Y. Chang","year":"1999","unstructured":"S.Y. Chang and H.-C. Hwang, \u201cThe worst-case analysis of the MULTIFIT algorithm for scheduling non simultaneous parallel machines,\u201d Discrete Applied Mathematics, vol.92, pp. 135\u2013147, 1999.","journal-title":"Discrete Applied Mathematics"},{"key":"389759_CR3","volume-title":"Worst-case performance of scheduling heuristics","author":"B. Chen","year":"1994","unstructured":"B. Chen, \u201cWorst-case performance of scheduling heuristics,\u201d Ph.D. Thesis,Erasmus University in Rotterdam, The Netherlands,1994."},{"key":"389759_CR4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02247409","volume":"57","author":"S.P. Chen","year":"1996","unstructured":"S.P. Chen, Y. He, and E.Y. Yao, \u201cThree-partitioning containing kernels: Complexity and heuristic,\u201d Computing, vol. 57, pp. 255\u2013272, 1996.","journal-title":"Computing"},{"key":"389759_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0167-6377(92)90004-M","volume":"11","author":"J. Csirik","year":"1992","unstructured":"J. Csirik, H. Kellerer, and G. Woeginger, \u201cThe exact LPT-bound for maximizing the minimum completion time,\u201d Operations Research Letters, vol. 11, pp. 281\u2013287, 1992.","journal-title":"Operations Research Letters"},{"key":"389759_CR6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"B.L. Deuermeyer","year":"1982","unstructured":"B.L. Deuermeyer, D.K. Friesen, and M.A. Langston, \u201cScheduling to maximize the minimum processor finish time in a multiprocessor system,\u201d SIAM Journal on Algebraic and Discrete Methods, vol. 3, pp.190\u2013196, 1982.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"389759_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1978","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Francisco, 1978."},{"key":"389759_CR8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"R.L. Graham, \u201cBounds on multiprocessing timing anomalies,\u201d SIAM Journal on Applied Mathematics, vol. 17, pp. 416\u2013429,1969.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"389759_CR9","first-page":"48","volume":"37","author":"H. Kellerer","year":"1999","unstructured":"H. Kellerer and V. Kotov, \u201cA 7\/6-approximation algorithm for 3-partitioning and its application to multiprocessor scheduling,\u201d INFOR, vol. 37, pp.48\u201356, 1999.","journal-title":"INFOR"},{"key":"389759_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0166-218X(93)90013-E","volume":"45","author":"H. Kellerer","year":"1993","unstructured":"H. Kellerer and G. Woeginger, \u201cA tight bound for 3-partitioning,\u201d Discrete Applied Mathematics, vol. 45, pp. 249\u2013259, 1993.","journal-title":"Discrete Applied Mathematics"},{"key":"389759_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","volume":"30","author":"C.Y. Lee","year":"1991","unstructured":"C.Y. Lee, \u201cParallel machine scheduling with non simultaneous machine available time,\u201d Discrete Applied Mathematics, vol. 30, pp. 53\u201361, 1991.","journal-title":"Discrete Applied Mathematics"},{"key":"389759_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0166-218X(99)00201-2","volume":"100","author":"C.Y. Lee","year":"2000","unstructured":"C.Y. Lee, Y. He, and G.C. Tang, \u201cA note on parallel machine scheduling with non-simultaneous machine available time,\u201d Discrete Applied Mathematics, vol. 100, pp. 133\u2013135, 2000.","journal-title":"Discrete Applied Mathematics"},{"key":"389759_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-6377(97)00053-9","volume":"22","author":"G.-H. Lin","year":"1998","unstructured":"G.-H. Lin, E.Y. Yao, and Y. He, \u201cParallel machine scheduling to maximize the minimum load with non simultaneous machine available times,\u201d Operations Research Letters, vol. 22, pp. 75\u201381,1998.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013370208101.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013370208101\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013370208101.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:09:10Z","timestamp":1751281750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013370208101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["389759"],"URL":"https:\/\/doi.org\/10.1023\/a:1013370208101","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}