{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T04:10:08Z","timestamp":1773461408564,"version":"3.50.1"},"reference-count":19,"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 fairly general model of stochastic scheduling problems, for which the class of preselective strategies was recently introduced. This class proved to be of considerable importance, one of the reasons being that it forms, in a certain sense, the greatest class of strategies leading to a certain stability behavior. Furthermore, this uncountably infinite class is essentially determined by a finite number of well\u2010behaving &lt;\u2010minimal strategies, viz. special so\u2010called MES or<jats:italic>s<\/jats:italic>\u2010induced strategies. This fact is used in the present article to show how MES strategies can be treated algo\u2010rithmically. The approach used is an implicit enumeration scheme, based on a branch\u2010and\u2010bound method; this is illustrated in a fair number of examples.<\/jats:p>","DOI":"10.1002\/net.3230130103","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T14:29:23Z","timestamp":1178893763000},"page":"29-48","source":"Crossref","is-referenced-by-count":56,"title":["Algorithmic approaches to preselective strategies for stochastic scheduling problems"],"prefix":"10.1002","volume":"13","author":[{"given":"G.","family":"Lgelmund","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":"Applications of Mathematical Programming","author":"Balas E.","year":"1971"},{"key":"e_1_2_1_3_2","volume-title":"Stochastic Optimal Control: The Discrete Time Case","author":"Bertsekas D. P.","year":"1978"},{"key":"e_1_2_1_4_2","volume-title":"Utility Theory for Decision Making","author":"Fishbum P. C.","year":"1970"},{"key":"e_1_2_1_5_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_6_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207727608941950"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.20.4.835"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46229-0"},{"key":"e_1_2_1_10_2","first-page":"1","article-title":"Preceding article, Preselective strategies for the optimization of stochastic project networks under resource constraints","volume":"12","author":"Igelmund G.","year":"1982","journal-title":"Networks"},{"key":"e_1_2_1_11_2","volume-title":"Netzplanoptimierung: Deterministische und stochastische Scheduling\u2010Prob\u2010leme \u00f6ber geordneten Strukturen","author":"Kaerkes R.","year":"1983"},{"key":"e_1_2_1_12_2","first-page":"225","article-title":"Scheduling problems with a singular solution","volume":"16","author":"M\u00f6hring R. H.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_13_2","article-title":"Optimality and stability of simple strategies for stochastic scheduling problems","author":"M\u00f6hring R. H.","journal-title":"ZOR."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800260314"},{"key":"e_1_2_1_15_2","first-page":"17","article-title":"Cost\u2010dependent essential systems of ES strategies for stochastic scheduling\u2010problems","volume":"42","author":"Radermacher F. J.","year":"1981","journal-title":"Methods of Oper. Res."},{"key":"e_1_2_1_16_2","unstructured":"F. J.Radermacher Optimale Strategien f\u00fcr stochastische Scheduling\u2010Probleme.Habilitationsschrift RWTH Aachen (1981)."},{"key":"e_1_2_1_17_2","volume-title":"Machine Scheduling Problems","author":"Rinnooy Kan A. H. G.","year":"1976"},{"key":"e_1_2_1_18_2","unstructured":"B.RoyandB.Sussmann Les Problems d'ordonnancement avec constraints dis\u2010jonctives.Note DS No. 9 bis SEMA Montrouge 1964."},{"key":"e_1_2_1_19_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":"40","author":"Weber R. R.","year":"1978","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.2307\/3212936"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:37:36Z","timestamp":1737005856000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["10.1002\/net.3230130103"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130103","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]]}}}