Dennis Schol
Dennis Schol has a total of 149 co-authors. Here are the top co-authors by number of shared publications:
- Bert Zwart
CWI, National Research Institute of Mathematics and Computer Science, Amsterdam, The Netherlands
3 shared publications - Maria Vlasiou
Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, Enschede, The Netherlands
3 shared publications A. Abokifa
Univ. of Illinois Chicago
1 shared publicationA. Di Nardo
Univ. of Campania Luigi Vanvitelli
1 shared publicationA. G. Seyoum
Univ. of Sheffield
1 shared publicationA. Gabriele
Univ. of Cassino and Southern Lazio
1 shared publication
Latest Publications
- 1 October 2025
- Published by American Society of Civil Engineers (ASCE) in Journal of Water Resources Planning and Management
- Vol. 151 (10)
Battle of Water Demand Forecasting
- 1 October 2025
- Published by American Society of Civil Engineers (ASCE) in Journal of Water Resources Planning and Management
- Vol. 151 (10)
Battle of Water Demand Forecasting
- 26 March 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Stochastic Systems
Optimization of Inventory and Capacity in Large-Scale Assembly Systems Using Extreme-Value Theory
High-tech systems are typically produced in two stages: (1) production of components using specialized equipment and staff and (2) system assembly/integration. Component production capacity is subject to fluctuations, causing a high risk of shortages of at least one component, which results in costly delays. Companies hedge this risk by strategic investments in excess production capacity and in buffer inventories of components. To optimize these, it is crucial to characterize the relation between component shortage risk and capacity and inventory investments. We suppose that component production capacity and produce demand are normally distributed over finite time intervals, and we accordingly model the production system as a symmetric fork-join queueing network with N statistically identical queues with a common arrival process and independent service processes. Assuming a symmetric cost structure, we subsequently apply extreme value theory to gain analytic insights into this optimization problem. We derive several new results for this queueing network, notably that the scaled maximum of N steady-state queue lengths converges in distribution to a Gaussian random variable. These results translate into asymptotically optimal methods to dimension the system. Tests on a range of problems reveal that these methods typically work well for systems of moderate size. Funding: This work is part of the research program Complexity in High-Tech Manufacturing, (partly) financed by the Dutch Research Council (NWO) [Grant 438.16.121]. The research is also supported by the NWO programs MEERVOUD to M. Vlasiou [Grant 632.003.002] and Talent VICI to B. Zwart [Grant 639.033.413].
- 26 March 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Stochastic Systems
Optimization of Inventory and Capacity in Large-Scale Assembly Systems Using Extreme-Value Theory
High-tech systems are typically produced in two stages: (1) production of components using specialized equipment and staff and (2) system assembly/integration. Component production capacity is subject to fluctuations, causing a high risk of shortages of at least one component, which results in costly delays. Companies hedge this risk by strategic investments in excess production capacity and in buffer inventories of components. To optimize these, it is crucial to characterize the relation between component shortage risk and capacity and inventory investments. We suppose that component production capacity and produce demand are normally distributed over finite time intervals, and we accordingly model the production system as a symmetric fork-join queueing network with N statistically identical queues with a common arrival process and independent service processes. Assuming a symmetric cost structure, we subsequently apply extreme value theory to gain analytic insights into this optimization problem. We derive several new results for this queueing network, notably that the scaled maximum of N steady-state queue lengths converges in distribution to a Gaussian random variable. These results translate into asymptotically optimal methods to dimension the system. Tests on a range of problems reveal that these methods typically work well for systems of moderate size. Funding: This work is part of the research program Complexity in High-Tech Manufacturing, (partly) financed by the Dutch Research Council (NWO) [Grant 438.16.121]. The research is also supported by the NWO programs MEERVOUD to M. Vlasiou [Grant 632.003.002] and Talent VICI to B. Zwart [Grant 639.033.413].
- Open Access
- 4 July 2023
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 164, 99-138
Tail asymptotics for the delay in a Brownian fork-join queue
- 4 July 2023
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 164, 99-138
Open AccessTail asymptotics for the delay in a Brownian fork-join queue
- 1 May 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 47 (2) , 1335-1364
Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times
In this paper, we study an N server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as N→∞. This fluid limit...
- 1 May 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 47 (2) , 1335-1364
Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times
In this paper, we study an N server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as N→∞. This fluid limit...