Longest path analysis in networks of queues: dynamic scheduling problems

DOI10.1016/J.EJOR.2005.02.018zbMath1116.90025OpenAlexW2080190885MaRDI QIDQ858339

Masatoshi Sakawa, Hideki Katagiri, Kosuke Kato, Amir Azaron

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.018

zbMATH Keywords

queueingschedulingstochastic processes

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (3)

Computing project makespan distributions: Markovian PERT networks revisited ⋮ QUBO formulations of the longest path problem ⋮ Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modelling complex assemblies as a queueing network for lead time control
• A comparative study of dispatching rules in dynamic flowshops and jobshops
• Distribution function of the shortest path in networks of queues
• Optimal control of service rates and arrivals in Jackson networks
• Estimating critical path and arc probabilities in stochastic activity networks
• A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
• A Simple Approximation to the Completion Time Distribution for a PERT Network
• Technical Note—Expected Completion Time in Pert Networks
• Simple priority rule combinations: An approach to improve both flow time and tardiness
• The Most Critical Path in a PERT Network
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Critical Path Analyses Via Chance Constrained and Stochastic Programming
• Distribution of the Time Through a Directed, Acyclic Network
• On the Expected Duration of PERT Type Networks
• Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis

This page was built for publication: Longest path analysis in networks of queues: dynamic scheduling problems