Katja Schimmelpfeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Katja Schimmelpfeng has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Stefan Helber
Leibniz University Hannover
6 shared publications - Florian Sahling
Leibniz Universität Hannover
2 shared publications - Raik Stolletz
University of Mannheim
2 shared publications Hendrik Butemann
University of Hohenheim
1 shared publicationKarl Inderfurth
Faculty of Economics and Management, Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany
1 shared publicationSteffen Kasper
Department of Production Management, Leibniz Universität Hannover, Hannover, Germany
1 shared publication
Latest Publications
- 24 June 2019
- Published by Springer Nature in Journal of Business Economics
- Vol. 90 (9) , 1289-1313
Long-term electricity production planning of a flexible biogas plant considering wear and tear
- 24 June 2019
- Published by Springer Nature in Journal of Business Economics
- Vol. 90 (9) , 1289-1313
Long-term electricity production planning of a flexible biogas plant considering wear and tear
- 20 October 2017
- Published by Taylor & Francis in IISE Transactions
- Vol. 50 (3) , 217-229
Flexible versus robust lot-scheduling subject to random production yield and deterministic dynamic demand
We consider the problem of scheduling production lots for multiple products competing for a common production resource that processes the product units serially. The demand for each product and period is assumed to be known with certainty, but the yield per production lot is random as the production process can reach an out-of-control state while processing each single product unit of a lot. A service-level constraint is used to limit the backlog in the presence of this yield uncertainty. We address the question of how to determine static production lots and how to schedule these lots over the discrete periods of a finite planning horizon. The scheduling problem is characterized by a trade-off between the cost of holding inventory and the cost of overtime, whereas the production output is uncertain. For this purpose, we develop a rigid and robust planning approach and two flexible heuristic scheduling approaches. In an extensive numerical study, we compare the different approaches to assess the cost of operating according to a robust plan as opposed to a flexible policy.
- 20 October 2017
- Published by Taylor & Francis in IISE Transactions
- Vol. 50 (3) , 217-229
Flexible versus robust lot-scheduling subject to random production yield and deterministic dynamic demand
We consider the problem of scheduling production lots for multiple products competing for a common production resource that processes the product units serially. The demand for each product and period is assumed to be known with certainty, but the yield per production lot is random as the production process can reach an out-of-control state while processing each single product unit of a lot. A service-level constraint is used to limit the backlog in the presence of this yield uncertainty. We address the question of how to determine static production lots and how to schedule these lots over the discrete periods of a finite planning horizon. The scheduling problem is characterized by a trade-off between the cost of holding inventory and the cost of overtime, whereas the production output is uncertain. For this purpose, we develop a rigid and robust planning approach and two flexible heuristic scheduling approaches. In an extensive numerical study, we compare the different approaches to assess the cost of operating according to a robust plan as opposed to a flexible policy.
- 23 August 2012
- Published by Springer Nature in Health Care Management Science
- Vol. 16 (1) , 1-13
Characteristics of service requests and service processes of fire and rescue service dispatch centers
A sufficient staffing level in fire and rescue dispatch centers is crucial for saving lives. Therefore, it is important to estimate the expected workload properly. For this purpose, we analyzed whether a dispatch center can be considered as a call center. Current call center publications very often model call arrivals as a non-homogeneous Poisson process. This bases on the underlying assumption of the caller’s independent decision to call or not to call. In case of an emergency, however, there are often calls from more than one person reporting the same incident and thus, these calls are not independent. Therefore, this paper focuses on the dependency of calls in a fire and rescue dispatch center. We analyzed and evaluated several distributions in this setting. Results are illustrated using real-world data collected from a typical German dispatch center in Cottbus (“Leitstelle Lausitz”). We identified the Pólya distribution as being superior to the Poisson distribution in describing the call arrival rate and the Weibull distribution to be more suitable than the exponential distribution for interarrival times and service times. However, the commonly used distributions offer acceptable approximations. This is important for estimating a sufficient staffing level in practice using, e.g., the Erlang-C model.
- 23 August 2012
- Published by Springer Nature in Health Care Management Science
- Vol. 16 (1) , 1-13
Characteristics of service requests and service processes of fire and rescue service dispatch centers
A sufficient staffing level in fire and rescue dispatch centers is crucial for saving lives. Therefore, it is important to estimate the expected workload properly. For this purpose, we analyzed whether a dispatch center can be considered as a call center. Current call center publications very often model call arrivals as a non-homogeneous Poisson process. This bases on the underlying assumption of the caller’s independent decision to call or not to call. In case of an emergency, however, there are often calls from more than one person reporting the same incident and thus, these calls are not independent. Therefore, this paper focuses on the dependency of calls in a fire and rescue dispatch center. We analyzed and evaluated several distributions in this setting. Results are illustrated using real-world data collected from a typical German dispatch center in Cottbus (“Leitstelle Lausitz”). We identified the Pólya distribution as being superior to the Poisson distribution in describing the call arrival rate and the Weibull distribution to be more suitable than the exponential distribution for interarrival times and service times. However, the commonly used distributions offer acceptable approximations. This is important for estimating a sufficient staffing level in practice using, e.g., the Erlang-C model.
- 15 February 2012
- Published by Springer Nature in OR Spectrum
- Vol. 35 (1) , 75-105
Dynamic capacitated lot sizing with random demand and dynamic safety stocks
- 15 February 2012
- Published by Springer Nature in OR Spectrum
- Vol. 35 (1) , 75-105
Dynamic capacitated lot sizing with random demand and dynamic safety stocks
- 15 October 2011
- Published by Springer Nature in OR Spectrum
- Vol. 34 (2) , 461-489
Decision support for rehabilitation hospital scheduling
- 15 October 2011
- Published by Springer Nature in OR Spectrum
- Vol. 34 (2) , 461-489
Decision support for rehabilitation hospital scheduling
- Open Access
- 1 March 2011
- Published by Springer Nature in Business Research
- Vol. 4 (1) , 98-115
Setting Inventory Levels of CONWIP Flow Lines via Linear Programming
This paper treats the problem of setting the inventory level and optimizing the buffer allocation of closed-loop flow lines operating under the constant-work-in-process (CONWIP) protocol. We solve a very large but simple linear program that models an entire simulation run of a closed-loop flow line in discrete time to determine a production rate estimate of the system. This approach introduced in Helber, Schimmelpfeng, Stolletz, and Lagershausen (2011) for open flow lines with limited buffer capacities is extended to closed-loop CONWIP flow lines. Via this method, both the CONWIP level and the buffer allocation can be optimized simultaneously. The first part of a numerical study deals with the accuracy of the method. In the second part, we focus on the relationship between the CONWIP inventory level and the short-term profit. The accuracy of the method turns out to be best for such configurations that maximize production rate and/or short-term profit.
- 1 March 2011
- Published by Springer Nature in Business Research
- Vol. 4 (1) , 98-115
Open AccessSetting Inventory Levels of CONWIP Flow Lines via Linear Programming
This paper treats the problem of setting the inventory level and optimizing the buffer allocation of closed-loop flow lines operating under the constant-work-in-process (CONWIP) protocol. We solve a very large but simple linear program that models an entire simulation run of a closed-loop flow line in discrete time to determine a production rate estimate of the system. This approach introduced in Helber, Schimmelpfeng, Stolletz, and Lagershausen (2011) for open flow lines with limited buffer capacities is extended to closed-loop CONWIP flow lines. Via this method, both the CONWIP level and the buffer allocation can be optimized simultaneously. The first part of a numerical study deals with the accuracy of the method. In the second part, we focus on the relationship between the CONWIP inventory level and the short-term profit. The accuracy of the method turns out to be best for such configurations that maximize production rate and/or short-term profit.
- 11 February 2010
- Published by Springer Nature in Annals of Operations Research
- Vol. 182 (1) , 193-211
Using linear programming to analyze and optimize stochastic flow lines
- 11 February 2010
- Published by Springer Nature in Annals of Operations Research
- Vol. 182 (1) , 193-211
Using linear programming to analyze and optimize stochastic flow lines
- 7 December 2006
- Published by Springer Nature in OR Spectrum
- Vol. 29 (4) , 783-803
Application of a real-world university-course timetabling model solved by integer programming
- 7 December 2006
- Published by Springer Nature in OR Spectrum
- Vol. 29 (4) , 783-803
Application of a real-world university-course timetabling model solved by integer programming
- 1 January 2002
- Published by Springer Nature
- p. 220-225
Schlußbetrachtung