{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:51:36Z","timestamp":1648871496562},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T00:00:00Z","timestamp":1235001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10626-009-0065-8","type":"journal-article","created":{"date-parts":[[2009,2,18]],"date-time":"2009-02-18T13:37:55Z","timestamp":1234964275000},"page":"347-376","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Node Visitation in Acyclic Stochastic Digraphs with Multi-threaded Traversals and Internal Visitation Requirements"],"prefix":"10.1007","volume":"19","author":[{"given":"Theologos","family":"Bountourelis","sequence":"first","affiliation":[]},{"given":"Spyros","family":"Reveliotis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,19]]},"reference":[{"key":"65_CR1","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming (2nd ed). Athena Scientific, Belmont","edition":"2"},{"key":"65_CR2","volume-title":"Dynamic programming and optimal control","author":"DP Bertsekas","year":"2005","unstructured":"Bertsekas DP (2005) Dynamic programming and optimal control (3rd ed). Athena Scientific, Belmont","edition":"3"},{"key":"65_CR3","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1006\/jagm.1999.1047","volume":"33","author":"D Bertsimas","year":"1999","unstructured":"Bertsimas D, Gamarnik D (1999) Asymptotically optimal algorithms for job shop scheduling and packet switching. J Algorithms 33:296\u2013318","journal-title":"J Algorithms"},{"key":"65_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s101070100272","volume":"92","author":"D Bertsimas","year":"2002","unstructured":"Bertsimas D, Sethuraman J (2002) From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. Math Program 92:61\u2013102","journal-title":"Math Program"},{"key":"65_CR5","volume-title":"Introduction to linear optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas D, Tsitsiklis JN (1997) Introduction to linear optimization. Athena Scientific, Belmont"},{"key":"65_CR6","volume-title":"Convergence of probability measures","author":"P Billingsley","year":"1968","unstructured":"Billingsley P (1968) Convergence of probability measures. Wiley, New York"},{"key":"65_CR7","doi-asserted-by":"crossref","unstructured":"Bountourelis T, Reveliotis S (2006) Optimal node visitation in acyclic stochastic digraphs. In: Proceedings the 8th intl workshop on discete event systems (WODES\u201906), IFAC, Ann Arbor, July 2006, pp\u00a0358\u2013365","DOI":"10.1109\/WODES.2006.382394"},{"key":"65_CR8","doi-asserted-by":"crossref","first-page":"2456","DOI":"10.23919\/ECC.2007.7068272","volume-title":"European control conference 2007","author":"T Bountourelis","year":"2007","unstructured":"Bountourelis T, Reveliotis S (2007) Rollout policies for the problem of optimal node visitation in acyclic stochastic digraphs. In: European control conference 2007. IEEE, Piscataway, pp\u00a02456\u20132463"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"Bountourelis T, Reveliotis SA (2008) Customized learning algorithms for episodic tasks with acyclic state spaces. School of Industrial & Systems Eng., Georgia Tech, Tech Rep","DOI":"10.1109\/COASE.2009.5234189"},{"key":"65_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5301-1","volume-title":"Fundamentals of queueing networks: performance, asymptotics, and optimization","author":"H Chen","year":"2001","unstructured":"Chen H, Yao DD (2001) Fundamentals of queueing networks: performance, asymptotics, and optimization. Springer, New York"},{"key":"65_CR11","unstructured":"Dai JG (1999) Stability of fluid and stochastic processing networks. Center for Mathematical Physics and Stochastics, University of Aarhus, Denmark, Tech Rep ISSN 1398-7957"},{"issue":"2","key":"65_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1214\/aop\/1176996709","volume":"2","author":"A Gut","year":"1974","unstructured":"Gut A (1974) On the moments and limit distibutions of some first passage times. Ann Probab 2(2):277\u2013308","journal-title":"Ann Probab"},{"key":"65_CR13","volume-title":"Control techniques for complex networks","author":"S Meyn","year":"2008","unstructured":"Meyn S (2008) Control techniques for complex networks. Cambridge University Press, Cambridge"},{"key":"65_CR14","first-page":"367","volume-title":"Encyclopedia of optimization","author":"J Ni\u00f1o\u2013Mora","year":"2001","unstructured":"Ni\u00f1o\u2013Mora J (2001) Stochastic scheduling. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Kluwer, Dordrecht, pp\u00a0367\u2013372"},{"key":"65_CR15","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"CH Papadimitriou","year":"1985","unstructured":"Papadimitriou CH (1985) Games against nature. J Comput Syst Sci 31:288\u2013301","journal-title":"J Comput Syst Sci"},{"key":"65_CR16","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Scheduling: theory, algorithms and systems (2nd ed). Prentice Hall, Upper Saddle River","edition":"2"},{"key":"65_CR17","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1080\/07408170600897536","volume":"39","author":"SA Reveliotis","year":"2007","unstructured":"Reveliotis SA (2007) Uncertainty management in optimal disassembly planning through learning-based strategies. IIE Trans 39:645\u2013658","journal-title":"IIE Trans"},{"key":"65_CR18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10626-007-0014-3","volume":"17","author":"SA Reveliotis","year":"2007","unstructured":"Reveliotis SA, Bountourelis T (2007) Efficient PAC learning for episodic tasks with acyclic state spaces. J Discrete Event Syst Theory Appl 17:307\u2013327","journal-title":"J Discrete Event Syst Theory Appl"},{"key":"65_CR19","unstructured":"Reveliotis SA, Bountourelis T (2008) Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints. School of Industrial & Systems Eng., Georgia Tech (under review in IEEE Trans Automat Contr), Tech Rep"},{"key":"65_CR20","volume-title":"Stochastic processes","author":"SM Ross","year":"1996","unstructured":"Ross SM (1996) Stochastic processes. Wiley, New York"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-009-0065-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-009-0065-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-009-0065-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:52Z","timestamp":1559231932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-009-0065-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,19]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["65"],"URL":"https:\/\/doi.org\/10.1007\/s10626-009-0065-8","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,19]]}}}