{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T15:46:00Z","timestamp":1791042360535,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540854500","type":"print"},{"value":"9783540854517","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85451-7_94","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T13:15:29Z","timestamp":1219151729000},"page":"877-886","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Jeannot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik","family":"Saule","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"94_CR1","unstructured":"Bouteiller, A., Herault, T., Krawezik, G., Lemarinier, P., Cappello, F.: Mpich-v: a multiprotocol fault tolerant mpi. International Journal of High Performance Computing and Applications (2005)"},{"key":"94_CR2","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)"},{"key":"94_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math.\u00a05, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"94_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T. Gonzalez","year":"1977","unstructured":"Gonzalez, T., Ibarra, O., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM Journal of Computing\u00a06, 155\u2013166 (1977)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"94_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"94_CR6","doi-asserted-by":"crossref","unstructured":"Dongarra, J.J., Jeannot, E., Saule, E., Shi, Z.: Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. In: Proc. of SPAA, pp. 280\u2013288 (2007)","DOI":"10.1145\/1248377.1248423"},{"issue":"3","key":"94_CR7","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/71.993209","volume":"13","author":"A. Dogan","year":"2002","unstructured":"Dogan, A., Ozg\u00fcner, F.: Matching and Scheduling Algorithms for Minimizing Execution Time and Failure Probability of Applications in Heterogeneous Computing. IEEE Trans. Parallel Distrib. Syst.\u00a013(3), 308\u2013323 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"94_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1093\/comjnl\/bxh086","volume":"48","author":"A. Dogan","year":"2005","unstructured":"Dogan, A., Ozg\u00fcner, F.: Bi-objective Scheduling Algorithms for Execution Time-Reliability Trade-off in Heterogeneous Computing Systems. Comput. J.\u00a048(3), 300\u2013314 (2005)","journal-title":"Comput. J."},{"key":"94_CR9","unstructured":"Shmoys, D.B., Tardos, E.: Scheduling unrelated machines with costs. In: Proceedings of the Fourth Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms, pp. 448\u2013454 (1993)"},{"key":"94_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/11672142_51","volume-title":"STACS 2006","author":"S. Albers","year":"2006","unstructured":"Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 621\u2013633. Springer, Heidelberg (2006)"},{"key":"94_CR11","unstructured":"Ho, K.: Dual criteria optimization problems for imprecise computation tasks. In: Leung, J.Y.T. (ed.) Handbook of Scheduling (2004)"},{"key":"94_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0167-6377(02)00189-X","volume":"31","author":"M. Voorneveld","year":"2003","unstructured":"Voorneveld, M.: Characterization of pareto dominance. Operations Research Letters\u00a031, 7\u201311 (2003)","journal-title":"Operations Research Letters"},{"issue":"2","key":"94_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A. Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Operations Research\u00a052(2), 229\u2013242 (2004)","journal-title":"Operations Research"},{"key":"94_CR14","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. of FOCS, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"94_CR15","doi-asserted-by":"crossref","unstructured":"Angel, E., Bampis, E., Gourv\u00e8s, L.: Approximation results for a bicriteria job scheduling problem on a single machine without preemption. Information processing letters\u00a094 (2005)","DOI":"10.1016\/j.ipl.2004.12.007"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2008 \u2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85451-7_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:37:15Z","timestamp":1738337835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85451-7_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540854500","9783540854517"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85451-7_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}