Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements

DOI10.1007/S10626-009-0065-8zbMath1192.93110OpenAlexW1987876419MaRDI QIDQ977005

Theologos Bountourelis, Spyros A. Reveliotis

Publication date: 16 June 2010

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.1240

zbMATH Keywords

stochastic schedulingstochastic shortest path problemsfluid relaxationacyclic stochastic digraphsoptimal node visitation

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Optimal stochastic control (93E20) Stochastic systems in control theory (general) (93E03)

Related Items (2)

Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements ⋮ Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints
• Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
• Games against nature
• On the moments and limit distributions of some first passage times
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• Efficient PAC learning for episodic tasks with acyclic state spaces
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Control Techniques for Complex Networks

This page was built for publication: Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements