Hans Daduna

Orcid: 0000-0001-6570-3012

Affiliations:
  • University of Hamburg, Germany


According to our database1, Hans Daduna authored at least 57 papers between 1976 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Stability of queueing-inventory systems with customers of different priorities.
Ann. Oper. Res., December, 2023

On queueing-inventory-location problems.
Ann. Oper. Res., December, 2023

Analysis of second order properties of production-inventory systems with lost sales.
Ann. Oper. Res., December, 2023

The Weber problem in logistic and services networks under congestion.
EURO J. Comput. Optim., January, 2023

2022
Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems.
OR Spectr., 2022

2020
Performance Analysis for Loss Systems with Many Subscribers and Concurrent Services.
Proceedings of the Measurement, Modelling and Evaluation of Computing Systems, 2020

Graph-Based Mobility Models: Asymptotic and Stationary Node Distribution.
Proceedings of the Measurement, Modelling and Evaluation of Computing Systems, 2020

2019
Robustness analysis of generalized Jackson network.
Comput. Manag. Sci., 2019

Optimal capacity allocation in a production-inventory system with base stock.
Ann. Oper. Res., 2019

2018
Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining.
Perform. Evaluation, 2018

2017
Analysis of Jackson networks with infinite supply and unreliable nodes.
Queueing Syst. Theory Appl., 2017

2016
Monotonicity of base stock policies.
Oper. Res. Lett., 2016

Nonergodic Jackson networks with infinite supply-local stabilization and local equilibrium analysis.
J. Appl. Probab., 2016

Moving Queue on a Network.
Proceedings of the Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems, 2016

2015
Loss systems in a random environment: steady state analysis.
Queueing Syst. Theory Appl., 2015

2014
The cyclic queue and the tandem queue.
Queueing Syst. Theory Appl., 2014

Modeling and Performance Analysis of a Node in Fault Tolerant Wireless Sensor Networks.
Proceedings of the Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2014

2012
Weak Convergence Limits for Closed Cyclic Networks of Queues with Multiple Bottleneck Nodes.
J. Appl. Probab., 2012

Availability in Large Networks: Global Characteristics from Local Unreliability Properties.
Proceedings of the Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2012

2010
Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model.
Queueing Syst. Theory Appl., 2010

2009
On the behavior of stable subnetworks in non-ergodic networks with unreliable nodes.
Comput. Networks, 2009

2008
Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates.
Queueing Syst. Theory Appl., 2008

Customer Oriented Performance Measures for Packet Transmission in a Ring Network with Blocking.
Proceedings of the Proceedings 14th GI/ITG Conference on Measurement, Modelling and Evaluation of Computer and Communication Systems (MMB 2008), March 31, 2008

2006
M/M/1 Queueing systems with inventory.
Queueing Syst. Theory Appl., 2006

Queueing systems with inventory management with random lead times and with backordering.
Math. Methods Oper. Res., 2006

Availability and performance analysis in a discrete-time tandem network with product-form steady state.
Proceedings of the Proceedings 13th GI/ITG Conference on Measuring, 2006

2005
An invariance property of sojourn times in cyclic networks.
Oper. Res. Lett., 2005

2004
Stochastic games for distributed players on graphs.
Math. Methods Oper. Res., 2004

Degradable Networks with General up and down Time Distributions.
Proceedings of the MMB & PGTS 2004, 2004

2003
Dependence structure of sojourn times via partition separated ordering.
Oper. Res. Lett., 2003

2002
Discrete time tandem networks of queues - Effects of different regulation schemes for simultaneous events.
Perform. Evaluation, 2002

2001
Queueing Networks with Discrete Time Scale - Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks
Lecture Notes in Computer Science 2046, Springer, ISBN: 3-540-42357-5, 2001

2000
On the correlation of sojourn times in open networks of exponential multiserver queues.
Queueing Syst. Theory Appl., 2000

1999
Individual customer's behaviour in networks with state-dependent arrival rates.
Queueing Syst. Theory Appl., 1999

Optimal admission control for M/D/1/K queueing systems.
Math. Methods Oper. Res., 1999

1997
The joint distribution of sojourn times for a customer traversing an overtake-free series of queues: The discrete time case.
Queueing Syst. Theory Appl., 1997

Some Results for Steady-State and Sojourn Time Distributions in Open and Closed Linear Networks of Bernoulli Servers with State-Dependent Service and Arrival Rates.
Perform. Evaluation, 1997

Discrete Time Analysis of a State Dependent Tandem with Different Customer Types.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
Book reviews.
Math. Methods Oper. Res., 1996

The cycle time distribution in a cycle of Bernoulli servers in discrete time.
Math. Methods Oper. Res., 1996

1994
On the stability of queueing systems under precedence restrictions for the service of customers.
Queueing Syst. Theory Appl., 1994

1991
A concurrency control problem in a time-sharing system with different job types.
Kybernetika, 1991

1990
Exchangeable Items in Repair Systems: Delay Times.
Oper. Res., 1990

1989
Simultaneous Busy Periods for Nodes in a Stochastic Network.
Perform. Evaluation, 1989

Mean Value Analysis for the Duration of Heavy Traffic Periods in Subnetworks of a Queueing Network.
Proceedings of the Messung, 1989

1988
Busy periods for subnetworks in stochastic networks: mean value analysis.
J. ACM, 1988

1986
Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time.
Oper. Res., 1986

Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory.
Oper. Res., 1986

1985
The Distribution of Residence Times and Cycle Times in a Closed Tandem of Processor Sharing Queues.
Proceedings of the Messung, 1985

1983
The Time for a Round Trip in a Cycle of Exponential Queues
J. ACM, January, 1983

Networks of queues in discrete time.
Z. Oper. Research, 1983

On passage times in Jackson networks: Two-stations walk and overtake-free paths.
Z. Oper. Research, 1983

A Discrete Time technique for Solving Closed Queueing Network Models of Computer Systems.
Proceedings of the Messung, 1983

1981
On the Structure of General Stochastic Automata.
RAIRO Theor. Informatics Appl., 1981

A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions.
Acta Informatica, 1981

1977
Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory.
Proceedings of the Fundamentals of Computation Theory, 1977

1976
Stochastische Algebra über höchstens abzählbaren Mengen.
J. Inf. Process. Cybern., 1976


  Loading...