Alex Kuiper

Alex Kuiper

Auto-generated profile, based on publicly available information

Alex Kuiper

Amsterdam Business School, University of Amsterdam

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 September 2022 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
SSSara Saadatmand
Sara Saadatmand
Khodakaram SalimifardKhodakaram Salimifard
Khodakaram Salimifard
RMReza Mohammadi
Reza Mohammadi
AKAlex Kuiper
Alex Kuiper
MMMaryam Marzban
Maryam Marzban
AFAkram Farhadi
Akram Farhadi

18 April 2014 in Queueing Systems
Verified
Journal Article
Closed access
PDF file
AKAlex Kuiper
Alex Kuiper
BKBenjamin Kemper
Benjamin Kemper
MMMichel Mandjes
Michel Mandjes

21 March 2018 in Quality Engineering
Verified
Journal Article
Closed access
IZInez Zwetsloot
Inez Zwetsloot
AKAlex Kuiper
Alex Kuiper
TAThomas S. Akkerhuis
Thomas S. Akkerhuis
HKHenk de Koning
Henk de Koning
The amount of available data is rapidly increasing, which is an opportunity to the Lean Six Sigma (LSS) methodology. Starting off with a well-established definition of LSS as theoretical foundations we employ theory-generating case-study research. Three successful improvement projects from a large financial services firm in the Netherlands are analyzed. Clear differences to the definition of LSS are observed. The research leads to three recommendations for integrating data science in LSS. Concerning the structure of an improvement organization, skills of employees and, practical modifications to LSS's celebrated DMAIC roadmap to solidify its applicability in the modern age of data.

4 May 2021 in Decision Sciences
Verified
Journal Article
Open access
PDF file
AKAlex Kuiper
Alex Kuiper
MMMichel Mandjes
Michel Mandjes
JMJeroen de Mast
Jeroen de Mast
RBRuben Brokkelkamp
Ruben Brokkelkamp
Appointment scheduling is generally applied in outpatient clinics and other healthcare services. The challenge in scheduling is to find a strategy for dealing with variability and unpredictability in service duration and patient arrivals. The consequences of an ineffective strategy include long waiting times for patients and idle time for the healthcare provider. In turn, these have implications for the perceived quality, cost‐efficiency, and capacity of healthcare services. The generation of optimal schedules is a notoriously intractable problem, and earlier attempts at designing effective strategies for appointment scheduling were based on approximation, simulation, or simplification. We propose a novel strategy for scheduling that exploits three tactical ideas to make the problem manageable. We compare the proposed strategy to other approaches, and show that it matches or outperforms competing methods in terms of flexibility, ease of use, and speed. More importantly, it outperforms competing approaches nearly uniformly in approaching the desired balance between waiting and idle times as specified in a chosen objective function. Therefore, the strategy is a good basis for further enrichments.

1 October 2022 in Management Science
Verified
Journal Article
Closed access
AKAlex Kuiper
Alex Kuiper
RLRobert H. Lee
Robert H. Lee
Appointment schedules, in essence, balance supply and demand and are often employed in settings where resources are scarce and thus a high utilization is realized (e.g., healthcare). Whereas most of the existing literature focuses on the single-server case, a framework is developed to study appointment scheduling in multiserver settings. Relying on phase-type approximations, general service-time distributions are modeled, which are fed into a recursive approach allowing evaluation and optimization of an objective function that balances expected waiting times and idle times. Studying optimized schedules for multiple servers reveals that the start and end of a session can deviate greatly from the dome-shaped pattern as established for the single-server case. Furthermore, a comparison of various multiserver setups shows that significant performance gains can be achieved when servers are pooled. This allows an explicit quantification of the cost of continuity of care. In addition, session overtime as well as early finish of servers can be incorporated in the approach; the benefits of the additional flexibility that a multiserver setting provides are summarized. For the stationary plateau of the dome, to which the optimal interarrival times converge, steady-state appointment schedules are obtained by exploiting the embedded Markov chain; these schedules are shown and argued to converge quickly to optimal solutions obtained in a heavy-traffic regime. In this regime, algebraic solutions are derived, which provide interesting managerial guidelines when the pooling of servers is considered in appointment scheduling. This paper was accepted by Bariş Ata, stochastic models and simulation.

15 June 2023 in Computers & Operations Research
Verified
Journal Article
Open access
MGMayukh Ghosh
Mayukh Ghosh
AKAlex Kuiper
Alex Kuiper
RMRoshan Mahes
Roshan Mahes
DMDonato Maragno
Donato Maragno