{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:46:43Z","timestamp":1649058403796},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,9,18]],"date-time":"2014-09-18T00:00:00Z","timestamp":1410998400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s11590-014-0796-9","type":"journal-article","created":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T18:06:37Z","timestamp":1410977197000},"page":"1025-1037","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new approach for bicriteria partitioning problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Mengyang","family":"Gu","sequence":"first","affiliation":[]},{"given":"Zhiyi","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Binzhou","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Yujie","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,18]]},"reference":[{"issue":"1","key":"796_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55\u201366 (1998)","journal-title":"J. Sched."},{"key":"796_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.orl.2006.01.004","volume":"35","author":"E Angel","year":"2007","unstructured":"Angel, E., Bampis, E., Fishkin, A.V.: A note on scheduling to meet two min-sum objectives. Oper. Res. Lett. 35, 69\u201373 (2007)","journal-title":"Oper. Res. Lett."},{"key":"796_CR3","unstructured":"Aslam, J., Rasala, A., Stein, C., Young, N.: Improved bicriteria existence theorems for scheduling. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 846\u2013847 (1999)"},{"key":"796_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01193837","volume":"47","author":"L Babel","year":"1998","unstructured":"Babel, L., Kellerer, H., Kotov, V.: The $$k$$ k -partitioning problem. Math. Methods Oper. Res. 47, 59\u201382 (1998)","journal-title":"Math. Methods Oper. Res."},{"key":"796_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10951-005-1637-6","volume":"8","author":"E Bampis","year":"2005","unstructured":"Bampis, E., Kononov, A.: Bicriteria approximation algorithms for scheduling problems with communications delays. J. Sched. 8, 281\u2013294 (2005)","journal-title":"J. Sched."},{"key":"796_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"796_CR7","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.: The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett. 11, 281\u2013287 (1992)","journal-title":"Oper. Res. Lett."},{"key":"796_CR8","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.: Optimal scheduling of tasks on identical parallel processors. ORSA J. Comput. 7, 191\u2013200 (1995)","journal-title":"ORSA J. Comput."},{"key":"796_CR9","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.tcs.2006.05.025","volume":"359","author":"PS Efraimidis","year":"2006","unstructured":"Efraimidis, P.S., Spirakis, P.G.: Approximation schemes for scheduling and covering on unrelated machines. Theor. Comput. Sci. 359, 400\u2013417 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"796_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1978)"},{"key":"796_CR11","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell Syst. Tech. J. 45, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"796_CR12","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"796_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"796_CR14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10288-007-0053-5","volume":"6","author":"M Haouari","year":"2008","unstructured":"Haouari, M., Jemmali, M.: Maximizing the minimum completion time on parallel machines. 4OR Q. J. Oper. Res. 6, 375\u2013392 (2008)","journal-title":"4OR Q. J. Oper. Res."},{"key":"796_CR15","first-page":"359","volume":"39","author":"H Kellerer","year":"2011","unstructured":"Kellerer, H., Kotov, V.: A $$3\/2$$ 3 \/ 2 -approximation algorithm for $$k_i$$ k i -partitioning. Oper. Res. Lett. 39, 359\u2013362 (2011)","journal-title":"Oper. Res. Lett."},{"key":"796_CR16","unstructured":"Rasala, A., Stein, C., Torng, E., Uthaisombut, P.: Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 723\u2013731 (2002)"},{"key":"796_CR17","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach. 23, 116\u2013127 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"796_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0167-6377(97)00025-4","volume":"21","author":"C Stein","year":"1997","unstructured":"Stein, C., Wein, J.: On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Oper. Res. Lett. 21, 115\u2013122 (1997)","journal-title":"Oper. Res. Lett."},{"key":"796_CR19","volume-title":"Multicriteria Scheduling: Theory, Models and Algorithms","author":"V T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., Billaut, J.C.: Multicriteria Scheduling: Theory, Models and Algorithms, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"796_CR20","unstructured":"Torng, E., Uthaisombut, P.: Lower bounds for srpt-subsequence algorithms for nonpreemptive scheduling. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 973\u2013974 (1999)"},{"key":"796_CR21","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. Oper. Res. Lett. 20, 149\u2013154 (1997)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0796-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0796-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0796-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:39Z","timestamp":1559409099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0796-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,18]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["796"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0796-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,18]]}}}