{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:18Z","timestamp":1751634258843},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_3","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T09:33:14Z","timestamp":1182159194000},"page":"15-26","source":"Crossref","is-referenced-by-count":25,"title":["Scheduling under Uncertainty: Optimizing against a Randomizing Adversary"],"prefix":"10.1007","author":[{"given":"Rolf H.","family":"M\u00f6hring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"P. Brucker, A. Drexl, R. H. M\u00f6hring, K. Neumann, and E. Pesch. Resource-constrained project scheduling:Not tion, classiffication, models, nd methods. European J. Oper. Res., 112(1):3\u201341, 1999.","journal-title":"European J. Oper. Res."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1287\/opre.10.6.808","volume":"10","author":"D. R. Fulkerson","year":"1962","unstructured":"D. R Fulkerson. Expected critical path lengths in PERT networks. Oper. Res., 10:808\u2013817, 1962.","journal-title":"Oper. Res."},{"key":"3_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-63397-9_18","volume-title":"Algorithms \u2014 ESA\u201997, 5th Annual Eu-ropean Symposium","author":"K. D. Glazebrook","year":"1997","unstructured":"K. D. Glazebrook and J. Ni\u00f1o-Mora. Schedulingmulticlass queuingnetworks on parallel servers:Approxim te nd he vy-traffic optimility of Klimov\u2019s rule. In R. Burkard and G. Woeginger, editors, Algorithms \u2014 ESA\u201997, 5th Annual Eu-ropean Symposium pages 232\u2013245. Springer-Verlag, Lecture Notes in Computer Science, vol. 1284, 1997."},{"key":"3_CR4","unstructured":"M. H. Goldwasser and R. Motwani. Complexity measures for ssembly sequences. International Journal of Computational Geometry and Applications To apear."},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1968","unstructured":"R. L. Graham. Bounds on multiprocessingtiminganom lies. Bell Systems Tech. Journal 45:1563\u20131581, 1968.","journal-title":"Bell Systems Tech. Journal"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L. A. Hall","year":"1997","unstructured":"L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Schedulingto minimize average completion time:off-line and on-line approximation algorithms. Mathematics Oper. Res., 22(3):513\u2013544, 1997.","journal-title":"Mathematics Oper. Res."},{"key":"3_CR7","first-page":"85","volume":"42","author":"U. Heller","year":"1981","unstructured":"U. Heller. On the shortest overall duration in stochastic project networks. Methods Oper. Res., 42:85\u2013104, 1981.","journal-title":"Methods Oper. Res."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230130102","volume":"13","author":"G. Igelmund","year":"1983","unstructured":"G. Igelmund and F. J. Radermacher. Preselective strategies for the optimization of stochastic project networks under resource constr ints. Networks 13:1\u201328, 1983.","journal-title":"Networks"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"R. H. M\u00f6hring and F. J. Radermacher. Introduction to stochastic schedulingproblems. In K. Neumann and D. Pallaschke, editors, Contributions to Operations Re-search, Proceedings of the Oberwolfach Conference on Operations Research, 1984 pages 72\u2013130. Springer-Verlag, Lecture Notes in Economics and Mathematical Systems, vol. 240, 1985.","DOI":"10.1007\/978-3-642-46534-5_6"},{"key":"3_CR10","first-page":"65","volume":"29","author":"R. H. M\u00f6hring","year":"1985","unstructured":"R. H. M\u00f6hring, F. J. Radermacher, and G. Weiss. Stochastic scheduling problems II. Set strategies. Z. Oper. Res. Ser. A 29:65\u2013104, 1985.","journal-title":"Z. Oper. Res. Ser. A"},{"issue":"6","key":"3_CR11","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1145\/331524.331530","volume":"46","author":". R. H. M\u00f6hring","year":"1999","unstructured":". R. H. M\u00f6hring, A. S. Schulz, and M. Uetz. Approxim tion in stoch stic scheduling: the power of LP-b sed priority policies. J. Assoc. Comp. Mach., 46(6):924\u2013942, 1999.","journal-title":"J. Assoc. Comp. Mach."},{"key":"3_CR12","series-title":"Technical Report","volume-title":"Scheduling with AND\/OR precedence constraints","author":"R. H. M\u00f6hring","year":"2000","unstructured":"R. H. M\u00f6hring, M. Skutella, and F. Stork. Scheduling with AND\/OR precedence constraints. Technical Report 646, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1999. Revised July 2000."},{"key":"3_CR13","unstructured":"R. H. M\u00f6hring, M. Skutell, and F. Stork. Forcing rel tions for AND\/OR precedence constr ints. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA pages 235\u2013236, 2000."},{"key":"3_CR14","series-title":"Technical Report","volume-title":"Mathematical Methods of Operations Research","author":"R. H. M\u00f6hring","year":"1998","unstructured":"R. H. M\u00f6hring and F. Stork. Linear preselective strategies for stochastic project scheduling. Technical Report 612, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1998. To appear in and Mathematical Methods of Operations Research."},{"key":"3_CR15","first-page":"467","volume":"53","author":"F. J. Radermacher","year":"1986","unstructured":"F. J. Radermacher. Analytical vs. combin torial characteriz tions of well-behaved strategies in stochastic scheduling. Methods Oper. Res., 53:467\u2013475, 1986.","journal-title":"Methods Oper. Res."},{"key":"3_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online Algorithms: The State of the Art","author":"16. J. Sgall","year":"1998","unstructured":"16. J. Sgall. On-line scheduling. In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art pages 196\u2013231. Springer-Verlag, Lecture Notes in Computer Science, vol. 1442, 1998."},{"key":"3_CR17","series-title":"Technical Report","volume-title":"A branch-nd-bound lgorithm for minimizing expected m kespan in stoch stic project networks with resource constraints","author":"F. Stork","year":"1998","unstructured":"F. Stork. A branch-nd-bound lgorithm for minimizing expected m kespan in stoch stic project networks with resource constraints. Technical Report 613, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1998."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.2307\/3212936","volume":"17","author":"G. Weiss","year":"1980","unstructured":"G. Weiss and M. Pinedo. Schedulingt sks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Prob., 17:187\u2013202, 1980.","journal-title":"J. Appl. Prob."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"U. Zwick and M. Paterson. The complexity of Mean Payoff. Games on graphs. Theor. Comp. Sc., 158:343\u2013359, 1996.","journal-title":"Theor. Comp. Sc."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:55:09Z","timestamp":1556510109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}