{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:12:15Z","timestamp":1774415535092,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642183171","type":"print"},{"value":"9783642183188","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18318-8_13","type":"book-chapter","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T08:58:06Z","timestamp":1295859486000},"page":"142-153","source":"Crossref","is-referenced-by-count":1,"title":["Lower Bounds for Smith\u2019s Rule in Stochastic Machine Scheduling"],"prefix":"10.1007","author":[{"given":"Caroline","family":"Jagtenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Schwiegelshohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/322234.322242","volume":"28","author":"J.L. Bruno","year":"1981","unstructured":"Bruno, J.L., Downey, P.J., Frederickson, G.N.: Sequencing tasks with exponential service times to minimize the expected flowtime or makespan. Journal of the ACM\u00a028, 100\u2013113 (1981)","journal-title":"Journal of the ACM"},{"key":"13_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. 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. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1017\/S0021900200031077","volume":"24","author":"T. K\u00e4mpke","year":"1987","unstructured":"K\u00e4mpke, T.: On the optimality of static priority policies in stochastic scheduling on parallel machines. Journal of Applied Probability\u00a024, 430\u2013448 (1987)","journal-title":"Journal of Applied Probability"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T. Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., Kyan, S.: Worst case bound on an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing\u00a015, 1119\u20131129 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR6","first-page":"193","volume":"28","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems I: General strategies. ZOR - Zeitschrift f\u00fcr Operations Research\u00a028, 193\u2013260 (1984)","journal-title":"ZOR - Zeitschrift f\u00fcr Operations Research"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1145\/331524.331530","volume":"46","author":"R.H. M\u00f6hring","year":"1999","unstructured":"M\u00f6hring, R.H., Schulz, A.S., Uetz, M.: Approximation in stochastic scheduling: The power of LP-based priority policies. Journal of the ACM\u00a046, 924\u2013942 (1999)","journal-title":"Journal of the ACM"},{"key":"13_CR8","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice-Hall, Upper Saddle River (2002)","edition":"2"},{"key":"13_CR9","first-page":"703","volume":"12","author":"M.H. Rothkopf","year":"1966","unstructured":"Rothkopf, M.H.: Scheduling with random service times. Management Science\u00a012, 703\u2013713 (1966)","journal-title":"Management Science"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/moor.25.1.63.15212","volume":"25","author":"M. Skutella","year":"2000","unstructured":"Skutella, M., Woeginger, G.J.: A PTAS for minimizing the total weighted completion time on identical parallel machines. Mathematics of Operations Research\u00a025, 63\u201375 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly\u00a03, 59\u201366 (1956)","journal-title":"Naval Research Logistics Quarterly"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0167-6377(03)00047-6","volume":"31","author":"M. Uetz","year":"2003","unstructured":"Uetz, M.: When greediness fails: examples from stochastic scheduling. Operations Research Letters\u00a031, 413\u2013419 (2003)","journal-title":"Operations Research Letters"},{"key":"13_CR13","unstructured":"Uetz, M.: Algorithms for Deterministic and Stochastic Scheduling. PhD thesis, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Germany (2001); published by Cuvillier Verlag, G\u00f6ttingen, Germany (2002)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18318-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T00:29:15Z","timestamp":1553387355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18318-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183171","9783642183188"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18318-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}