{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:31:08Z","timestamp":1755999068537},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,11,18]],"date-time":"2010-11-18T00:00:00Z","timestamp":1290038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10951-010-0206-9","type":"journal-article","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T12:33:50Z","timestamp":1289997230000},"page":"571-581","source":"Crossref","is-referenced-by-count":5,"title":["A system-centric metric for the evaluation of online job schedules"],"prefix":"10.1007","volume":"14","author":[{"given":"Uwe","family":"Schwiegelshohn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,18]]},"reference":[{"issue":"3","key":"206_CR1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s004530010051","volume":"29","author":"A. Avidor","year":"2001","unstructured":"Avidor, A., Azar, Y., & Sgall, J. (2001). Ancient and new algorithms for load balancing in the p-norm. Algorithmica, 29(3), 422\u2013441.","journal-title":"Algorithmica"},{"key":"206_CR2","first-page":"242","volume-title":"ACM symposium on theory of computing (STOC)","author":"N. Bansal","year":"2003","unstructured":"Bansal, N., & Pruhs, K. (2003). Server scheduling in the l p norm: a rising tide lifts all boats. In ACM symposium on theory of computing (STOC) (pp. 242\u2013250). Berlin: Springer."},{"key":"206_CR3","volume-title":"Scheduling divisible loads in parallel and distributed systems","author":"V. Bharadwaj","year":"1996","unstructured":"Bharadwaj, V., Robertazzi, T. G., & Ghose, D. (1996). Scheduling divisible loads in parallel and distributed systems. Los Alamitos: IEEE Computer Society Press."},{"key":"206_CR4","first-page":"59","volume-title":"Proceedings of the 15th international parallel & distributed processing symposium (IPDPS-01)","author":"W. Cirne","year":"2001","unstructured":"Cirne, W., & Berman, F. (2001). A model for moldable supercomputer jobs. In Proceedings of the 15th international parallel & distributed processing symposium (IPDPS-01) (p.\u00a059). Berlin: Springer."},{"issue":"4","key":"206_CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/309746.309750","volume":"26","author":"A. B. Downey","year":"1999","unstructured":"Downey, A. B., & Feitelson, D. (1999). The elusive goal of workload characterization. ACM SIGMETRICS Performance Evaluation Review, 26(4), 14\u201329","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"206_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-63574-2_14","volume-title":"IPPS\u201997 workshop: job scheduling strategies for parallel processing","author":"D. Feitelson","year":"1997","unstructured":"Feitelson, D., Rudolph, L., Schwiegelshohn, U., Sevcik, K., & Wong,\u00a0P. (1997). Theory and practice in parallel job scheduling. In D.\u00a0Feitelson & L. Rudolph (Eds.), Lecture notes in computer science: Vol. 1291. IPPS\u201997 workshop: job scheduling strategies for parallel processing (pp.\u00a01\u201334). Berlin: Springer."},{"issue":"1","key":"206_CR7","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1016\/j.asoc.2007.05.009","volume":"8","author":"C. Franke","year":"2008","unstructured":"Franke, C., Hoffmann, F., Lepping, J., & Schwiegelshohn, U. (2008). Development of scheduling strategies with genetic fuzzy systems. Applied Soft Computing Journal, 8(1), 706\u2013721","journal-title":"Applied Soft Computing Journal"},{"key":"206_CR8","volume-title":"Computers and intractability: a\u00a0guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability: a\u00a0guide to the theory of NP-completeness. New York: Freeman."},{"key":"206_CR9","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. Graham","year":"1966","unstructured":"Graham, R. (1966). Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45, 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"206_CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"15","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Kan, A.R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a\u00a0survey. Annals of Discrete Mathematics, 15, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"206_CR11","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.tcs.2006.06.027","volume":"362","author":"M. Hussein","year":"2006","unstructured":"Hussein, M., & Schwiegelshohn, U. (2006). Utilization of nonclairvoyant online schedules. Theoretical Computer Science, 362, 238\u2013247.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"206_CR12","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T. Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., & Kyan, S. (1986). Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15(4), 1119\u20131129.","journal-title":"SIAM Journal on Computing"},{"key":"206_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1272366.1272381","volume-title":"HPDC \u201907: proceedings of the 16th international symposium on high performance distributed computing","author":"C. B. Lee","year":"2007","unstructured":"Lee, C. B., & Snavely, A. (2007). Precise and realistic utility functions for user-centric performance analysis of schedulers. In HPDC \u201907: proceedings of the 16th international symposium on high performance distributed computing (pp. 107\u2013116). Berlin: Springer."},{"key":"206_CR14","first-page":"153","volume-title":"Proceedings of the 10th workshop on job scheduling strategies for parallel processing","author":"C. B. Lee","year":"2004","unstructured":"Lee, C. B., Schwartzman, Y., Hardy, J., & Snavely, A. (2004). Are user runtime estimates inherently inaccurate? In Proceedings of the 10th workshop on job scheduling strategies for parallel processing (pp. 153\u2013161). Berlin: Springer."},{"key":"206_CR15","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-60153-8_35","volume-title":"IPPS\u201995 workshop: job scheduling strategies for parallel processing","author":"D. Lifka","year":"1995","unstructured":"Lifka, D. (1995). The ANL\/IBM SP scheduling system. In D. Feitelson & L. Rudolph (Eds.), Lecture notes in computer science: Vol. 949. IPPS\u201995 workshop: job scheduling strategies for parallel processing (pp. 295\u2013303). Berlin: Springer."},{"issue":"6","key":"206_CR16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0020-0190(01)00241-1","volume":"81","author":"E. Naroska","year":"2002","unstructured":"Naroska, E., & Schwiegelshohn, U. (2002). On an online scheduling problem for parallel jobs. Information Processing Letters, 81(6), 297\u2013304.","journal-title":"Information Processing Letters"},{"key":"206_CR17","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling: theory, algorithms, and systems (2nd ed.). New Jersey: Prentice-Hall.","edition":"2"},{"issue":"2","key":"206_CR18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01581271","volume":"58","author":"M. Queyranne","year":"1993","unstructured":"Queyranne, M. (1993). Structure of a simple scheduling polyhedron. Mathematical Programming, 58(2), 263\u2013285.","journal-title":"Mathematical Programming"},{"issue":"5","key":"206_CR19","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/1099-1425(200009\/10)3:5<297::AID-JOS50>3.0.CO;2-D","volume":"3","author":"U. Schwiegelshohn","year":"2000","unstructured":"Schwiegelshohn, U., & Yahyapour, R. (2000). Fairness in parallel job scheduling. Journal of Scheduling, 3(5), 297\u2013320.","journal-title":"Journal of Scheduling"},{"issue":"6","key":"206_CR20","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D. Shmoys","year":"1995","unstructured":"Shmoys, D., Wein, J., & Williamson, D. (1995). Scheduling parallel machines on-line. SIAM Journal on Computing, 24(6), 1313\u20131331.","journal-title":"SIAM Journal on Computing"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0206-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0206-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0206-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:45Z","timestamp":1559453985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0206-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,18]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["206"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0206-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,18]]}}}