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

DOI10.1007/S10626-009-0065-8zbMATH Open1192.93110OpenAlexW1987876419MaRDI QIDQ977005FDOQ977005

Authors: Theologos Bountourelis, Spyros 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

Recommendations

• Optimal Node Visitation in Stochastic Digraphs
• scientific article; zbMATH DE number 714460
• scientific article; zbMATH DE number 1984128
• A hierarchical approach for bounding the completion time distribution of stochastic task graphs
• The stochastic critical node problem over trees
• Publication:4861740
• Approximate throughput computation of stochastic marked graphs
• Stochastic flow networks via multiple paths under time threshold and budget constraint
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths

zbMATH Keywords

stochastic schedulingstochastic shortest path problemsfluid relaxationacyclic stochastic digraphsoptimal node visitation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the moments and limit distributions of some first passage times
• Dynamic programming and optimal control. Vol. 1.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Control Techniques for Complex Networks
• Games against nature
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Efficient PAC learning for episodic tasks with acyclic state spaces
• 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

Cited In (3)

• 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
• Optimal Node Visitation in Stochastic Digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q977005)