Longest path analysis in networks of queues: dynamic scheduling problems

DOI10.1016/J.EJOR.2005.02.018MaRDI QIDQ858339zbMATH OpenOpenAlexFDO

Authors Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatoshi Sakawa

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

queueingstochastic processesscheduling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 786512
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
• Scheduling networks of queues: Heavy traffic analysis of a simple open network
• Computing the Optimal Longest Queue Length in Torus Networks
• An analysis of an approximation algorithm for queueing networks
• Optimal dynamic scheduling of a general class of parallel-processing queueing systems
• Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
• A queueing framework for routing problems with time-dependent travel times
• scientific article; zbMATH DE number 934479

Cites work

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

Cited in

(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

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

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