{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T03:39:41Z","timestamp":1773805181459,"version":"3.50.1"},"reference-count":35,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8625,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article deals with a stochastic version of the optimization problem for project networks under resource constraints. In this, activity durations are assumed to be realized according to some joint probability distribution and the aim of optimization is to minimize the expected overall project cost (monotonically increasing with project duration). Certain strategies are known that constitute feasible solutions to this problem, the best studied of which are the so\u2010called ES strategies (\u201cearliest start\u201d with regard to fixed project structures). In this paper, a considerably broader class of strategies is introduced, namely preselective strategies. It is shown that this generalization, for which an algorithmic approach remains possible, preserves almost all the desirable behavior known for ES strategies. In particular, the number of \u201cessential\u201d strategies remains finite and even minimal optimum\u2010determining sets of such strategies can, in general, be characterized. Also, the analytic behavior is still proper and there is considerable \u201cstability\u201d to weak convergence of the joint distribution of activity durations as well as to a. e. convergence of the cost function. Last but not least, possible generalization to arbitrary regular cost functions is again imminent.<\/jats:p>","DOI":"10.1002\/net.3230130102","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T14:29:24Z","timestamp":1178893764000},"page":"1-28","source":"Crossref","is-referenced-by-count":119,"title":["Preselective strategies for the optimization of stochastic project networks under resource constraints"],"prefix":"10.1002","volume":"13","author":[{"given":"G.","family":"Igelmund","sequence":"first","affiliation":[]},{"given":"F. J.","family":"Radermacher","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Introduction to Sequencing and Scheduling","author":"Baker K. R.","year":"1974"},{"key":"e_1_2_1_3_2","volume-title":"Applications of Mathematical Programming","author":"Balas E.","year":"1971"},{"key":"e_1_2_1_4_2","volume-title":"Probability Theory and Elements of Measure Theory","author":"Bauer H.","year":"1972"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.10.4.734"},{"key":"e_1_2_1_6_2","volume-title":"Stochastic Optimal Control: The Discrete Time Case","author":"Bertsekas D. P.","year":"1978"},{"key":"e_1_2_1_7_2","volume-title":"Convergence of Probability Measures","author":"Billingsley P.","year":"1968"},{"key":"e_1_2_1_8_2","volume-title":"Theory of Scheduling","author":"Conway R. M.","year":"1967"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.12.B803"},{"key":"e_1_2_1_10_2","volume-title":"Activity Networks","author":"Elmaghraby S. E.","year":"1977"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177698701"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","article-title":"Bandit processes and dynamic allocation indices","volume":"41","author":"Gittins J. C.","year":"1979","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207727608941950"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.20.4.835"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_2_1_16_2","volume-title":"Measure Theory","author":"Halmos P. R.","year":"1969"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1972.48"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46229-0"},{"key":"e_1_2_1_19_2","first-page":"83","volume-title":"Industrial Scheduling","author":"Holt C. C.","year":"1963"},{"key":"e_1_2_1_20_2","first-page":"1","article-title":"Netzplan theorie","volume":"27","author":"Kaerkes R.","year":"1977","journal-title":"Methods of Oper. Res."},{"key":"e_1_2_1_21_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_22_2","article-title":"Optimality and Stability of set strategies for stochastic scheduling problems","author":"M\u00f6hring R. H.","journal-title":"ZOR."},{"key":"e_1_2_1_23_2","volume-title":"Operations Verfahren","author":"Neumann K.","year":"1975"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800260314"},{"key":"e_1_2_1_25_2","volume-title":"Project Planning by Network Analysis","author":"Prideaux J. D. C. A.","year":"1969"},{"key":"e_1_2_1_26_2","volume-title":"Kapazit\u00e4tsoptimierung in Netzpl\u00e4nen","author":"Radermacher F. J.","year":"1978"},{"key":"e_1_2_1_27_2","first-page":"17","volume":"42","author":"Radermacher F. J.","year":"1981","journal-title":"Cost\u2010dependent essential systems of ES\u2010strategies for stochastic scheduling problems. Methods of Oper. Res."},{"key":"e_1_2_1_28_2","volume-title":"Optimale Strategien f\u00fcr stochastische Scheduling\u2010Probleme","author":"Radermacher F. J.","year":"1981"},{"key":"e_1_2_1_29_2","volume-title":"Machine Scheduling Problems","author":"Rinnooy Kan A. H. G.","year":"1976"},{"key":"e_1_2_1_30_2","unstructured":"B.RoyandB.Sussman Les problems d'ordonnancement avec constraints dis\u2010jonctives.Note DS no. 9 bis SEMA Montrouge 1964."},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-86589-3"},{"key":"e_1_2_1_32_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070407"},{"key":"e_1_2_1_33_2","first-page":"113","article-title":"Bounds for the distribution functions of network variables","volume":"27","author":"Spelde H. G.","year":"1977","journal-title":"Methods of Oper. Res."},{"key":"e_1_2_1_34_2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1111\/j.2517-6161.1978.tb01045.x","article-title":"An optimal strategy in multi\u2010server stochastic scheduling","volume":"10","author":"Weber R. R.","year":"1978","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"e_1_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.2307\/3212936"},{"key":"e_1_2_1_36_2","unstructured":"J. D.Wiest The scheduling of large projects with limited resources. Ph.D. thesis Carnegie Institute of Technology (1963)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:37:42Z","timestamp":1737005862000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["10.1002\/net.3230130102"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130102","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}