Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
type: Item
instance of: scholarly article
title: Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
zbMATH Open document ID: 1192.93110
author: Theologos Bountourelis
author: Spyros Reveliotis
published in: Discrete Event Dynamic Systems
publication date: 2010-06-16T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 93E03
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 93E20
zbMATH DE Number: 5721678
zbMATH Keywords: optimal node visitation
zbMATH Keywords: acyclic stochastic digraphs
zbMATH Keywords: stochastic shortest path problems
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: fluid relaxation
MaRDI profile type: Publication
OpenAlex ID: W1987876419
cites work: Q3151174
cites work: Q3376698
cites work: Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
cites work: From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
cites work: Q5560061
cites work: Efficient PAC learning for episodic tasks with acyclic state spaces
cites work: Q2730382
cites work: On the moments and limit distributions of some first passage times
cites work: Control Techniques for Complex Networks
cites work: Games against nature
cites work: Q3525911
cites work: Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints
cites work: Q4367948
DOI: 10.1007/S10626-009-0065-8
Recommended article: Optimal Node Visitation in Stochastic Digraphs
Recommended article: Q4321471
Recommended article: Q4427761
Recommended article: A hierarchical approach for bounding the completion time distribution of stochastic task graphs
Recommended article: The stochastic critical node problem over trees
Recommended article: Q4861740
Recommended article: Approximate throughput computation of stochastic marked graphs
Recommended article: Stochastic flow networks via multiple paths under time threshold and budget constraint
Recommended article: A multi-objective approach for PH-graphs with applications to stochastic shortest paths
description: scientific article; zbMATH DE number 5721678