default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Daduna
Person information
- affiliation: University of Hamburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2001
[b1]Hans Daduna:
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 2001, ISBN 3-540-42357-5
Journal Articles
- 2023
- [j43]Hans Daduna
:
On queueing-inventory-location problems. Ann. Oper. Res. 331(2): 679-710 (2023) - [j42]Nha-Nghi de la Cruz, Hans Daduna:
Analysis of second order properties of production-inventory systems with lost sales. Ann. Oper. Res. 331(2): 899-921 (2023) - [j41]Sonja Otten, Hans Daduna:
Stability of queueing-inventory systems with customers of different priorities. Ann. Oper. Res. 331(2): 963-983 (2023) - [j40]Vanessa Lange, Hans Daduna:
The Weber problem in logistic and services networks under congestion. EURO J. Comput. Optim. 11: 100056 (2023) - 2022
- [j39]Sonja Otten, Ruslan K. Krenzler, Lin Xie, Hans Daduna, Karsten Kruse:
Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems. OR Spectr. 44(2): 603-648 (2022) - 2019
- [j38]Nha-Nghi de la Cruz, Hans Daduna:
Optimal capacity allocation in a production-inventory system with base stock. Ann. Oper. Res. 277(2): 329-344 (2019) - [j37]Joost Berkhout, Bernd Heidergott, Jennifer Sommer, Hans Daduna:
Robustness analysis of generalized Jackson network. Comput. Manag. Sci. 16(4): 697-714 (2019) - 2018
- [j36]Hans Daduna, Ruslan K. Krenzler, Robert Ritter, Dietrich Stoyan:
Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining. Perform. Evaluation 119: 5-26 (2018) - 2017
- [j35]Jennifer Sommer, Joost Berkhout, Hans Daduna, Bernd Heidergott:
Analysis of Jackson networks with infinite supply and unreliable nodes. Queueing Syst. Theory Appl. 87(1-2): 181-207 (2017) - 2016
- [j34]Jennifer Sommer, Hans Daduna, Bernd Heidergott:
Nonergodic Jackson networks with infinite supply-local stabilization and local equilibrium analysis. J. Appl. Probab. 53(4): 1125-1142 (2016) - [j33]Nha-Nghi de la Cruz, Hans Daduna:
Monotonicity of base stock policies. Oper. Res. Lett. 44(2): 186-190 (2016) - 2015
- [j32]Ruslan K. Krenzler, Hans Daduna:
Loss systems in a random environment: steady state analysis. Queueing Syst. Theory Appl. 80(1-2): 127-153 (2015) - 2014
- [j31]Onno J. Boxma, Hans Daduna:
The cyclic queue and the tandem queue. Queueing Syst. Theory Appl. 77(3): 275-295 (2014) - 2012
- [j30]Ole Stenzel, Hans Daduna:
Weak Convergence Limits for Closed Cyclic Networks of Queues with Multiple Bottleneck Nodes. J. Appl. Probab. 49(1): 60-83 (2012) - 2010
- [j29]Christian Malchin, Hans Daduna:
Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model. Queueing Syst. Theory Appl. 65(4): 385-421 (2010) - 2009
- [j28]J. Mylosz, Hans Daduna:
On the behavior of stable subnetworks in non-ergodic networks with unreliable nodes. Comput. Networks 53(8): 1249-1263 (2009) - 2008
- [j27]Hans Daduna, Victor Pestien, Subramanian Ramakrishnan:
Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates. Queueing Syst. Theory Appl. 58(3): 191-219 (2008) - 2006
- [j26]Maike Schwarz, Hans Daduna:
Queueing systems with inventory management with random lead times and with backordering. Math. Methods Oper. Res. 64(3): 383-414 (2006) - [j25]Maike Schwarz, Cornelia Sauer, Hans Daduna, Rafal Kulik, Ryszard Szekli:
M/M/1 Queueing systems with inventory. Queueing Syst. Theory Appl. 54(1): 55-78 (2006) - 2005
- [j24]Christian Malchin, Hans Daduna:
An invariance property of sojourn times in cyclic networks. Oper. Res. Lett. 33(1): 1-8 (2005) - 2004
- [j23]Ruslan K. Chornei, Hans Daduna, Pavel S. Knopov:
Stochastic games for distributed players on graphs. Math. Methods Oper. Res. 60(2): 279-298 (2004) - 2003
- [j22]Hans Daduna, Ryszard Szekli:
Dependence structure of sojourn times via partition separated ordering. Oper. Res. Lett. 31(3): 462-472 (2003) - 2002
- [j21]Bernadette Desert, Hans Daduna:
Discrete time tandem networks of queues - Effects of different regulation schemes for simultaneous events. Perform. Evaluation 47(2/3): 73-104 (2002) - 2000
- [j20]Hans Daduna, Ryszard Szekli:
On the correlation of sojourn times in open networks of exponential multiserver queues. Queueing Syst. Theory Appl. 34(1-4): 169-181 (2000) - 1999
- [j19]Hans Daduna, Pavel S. Knopov:
Optimal admission control for M/D/1/K queueing systems. Math. Methods Oper. Res. 50(1): 91-100 (1999) - [j18]Hans Daduna, Stephan Meyer:
Individual customer's behaviour in networks with state-dependent arrival rates. Queueing Syst. Theory Appl. 32(4): 351-362 (1999) - 1997
- [j17]Hans Daduna:
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 30(1-2): 3-18 (1997) - [j16]Hans Daduna:
The joint distribution of sojourn times for a customer traversing an overtake-free series of queues: The discrete time case. Queueing Syst. Theory Appl. 27(3-4): 297-323 (1997) - 1996
- [j15]Hans Daduna:
The cycle time distribution in a cycle of Bernoulli servers in discrete time. Math. Methods Oper. Res. 44(3): 295-332 (1996) - [j14]J. Zimmermann, Hans Daduna:
Book reviews. Math. Methods Oper. Res. 44(3): 420-422 (1996) - 1994
- [j13]Hans Daduna:
On the stability of queueing systems under precedence restrictions for the service of customers. Queueing Syst. Theory Appl. 17(1-2): 73-88 (1994) - 1991
- [j12]Hans Daduna:
A concurrency control problem in a time-sharing system with different job types. Kybernetika 27(1): 53-65 (1991) - 1990
- [j11]Hans Daduna:
Exchangeable Items in Repair Systems: Delay Times. Oper. Res. 38(2): 349-354 (1990) - 1989
- [j10]Hans Daduna:
Simultaneous Busy Periods for Nodes in a Stochastic Network. Perform. Evaluation 9(2): 103-109 (1989) - 1988
- [j9]Hans Daduna:
Busy periods for subnetworks in stochastic networks: mean value analysis. J. ACM 35(3): 668-674 (1988) - 1986
- [j8]Hans Daduna:
Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory. Oper. Res. 34(2): 281-288 (1986) - [j7]Hans Daduna:
Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time. Oper. Res. 34(3): 455-459 (1986) - 1983
- [j6]Rolf Schassberger, Hans Daduna:
The Time for a Round Trip in a Cycle of Exponential Queues. J. ACM 30(1): 146-150 (1983) - [j5]Hans Daduna, Rolf Schaßberger:
Networks of queues in discrete time. Z. Oper. Research 27(1): 159-175 (1983) - [j4]Hans Daduna:
On passage times in Jackson networks: Two-stations walk and overtake-free paths. Z. Oper. Research 27(1): 239-256 (1983) - 1981
- [j3]Hans Daduna, Rolf Schassberger:
A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions. Acta Informatica 15: 251-263 (1981) - [j2]Hans Daduna:
On the Structure of General Stochastic Automata. RAIRO Theor. Informatics Appl. 15(4): 287-302 (1981) - 1976
- [j1]Hans Daduna:
Stochastische Algebra über höchstens abzählbaren Mengen. J. Inf. Process. Cybern. 12(11/12): 589-598 (1976)
Conference and Workshop Papers
- 2020
- [c13]Hans Daduna, Ruslan K. Krenzler:
Performance Analysis for Loss Systems with Many Subscribers and Concurrent Services. MMB 2020: 118-135 - [c12]Hans Daduna:
Graph-Based Mobility Models: Asymptotic and Stationary Node Distribution. MMB 2020: 155-172 - 2016
- [c11]Hans Daduna:
Moving Queue on a Network. MMB/DFT 2016: 40-54 - 2014
- [c10]Ruslan K. Krenzler, Hans Daduna:
Modeling and Performance Analysis of a Node in Fault Tolerant Wireless Sensor Networks. MMB/DFT 2014: 73-87 - 2012
- [c9]Hans Daduna, Lars Peter Saul:
Availability in Large Networks: Global Characteristics from Local Unreliability Properties. MMB/DFT 2012: 1-15 - 2008
- [c8]Hans Daduna, Marten Holst:
Customer Oriented Performance Measures for Packet Transmission in a Ring Network with Blocking. MMB 2008: 223-236 - 2006
- [c7]Christian Malchin, Hans Daduna:
Availability and performance analysis in a discrete-time tandem network with product-form steady state. MMB 2006: 381-398 - 2004
- [c6]Cornelia Sauer, Hans Daduna:
Degradable Networks with General up and down Time Distributions. MMB 2004: 185-194 - 1997
- [c5]Hans Daduna:
Discrete Time Analysis of a State Dependent Tandem with Different Customer Types. Foundations of Computer Science: Potential - Theory - Cognition 1997: 287-296 - 1989
- [c4]Hans Daduna:
Mean Value Analysis for the Duration of Heavy Traffic Periods in Subnetworks of a Queueing Network. MMB 1989: 16-28 - 1985
- [c3]Hans Daduna:
The Distribution of Residence Times and Cycle Times in a Closed Tandem of Processor Sharing Queues. MMB 1985: 127-140 - 1983
- [c2]Rolf Schassberger, Hans Daduna:
A Discrete Time technique for Solving Closed Queueing Network Models of Computer Systems. MMB 1983: 122-134 - 1977
- [c1]Hans Daduna:
Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory. FCT 1977: 72-77
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-06 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
