Stefan Creemers
Research Subjects
Stefan Creemers has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Luis Fernando Pérez Armas
Catholic University of Lille - IÉSEG School of Management, Lille Campus
6 shared publications - Roel Leus
Faculty of Economics and Business, KU Leuven, Louvain, Belgium
5 shared publications - Maud Van Den Broeke
IESEG School of Management, LEM-CNRS Lille, 9221, 59000 Lille, France
4 shared publications - Robert N. Boute
Vlerick Business School, 9000 Gent, Belgium
4 shared publications - Bart Devoldere
Vlerick Business School, 9000 Gent, Belgium
2 shared publications - Bram J. De Moor2 shared publications
Latest Publications
- 27 May 2026
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 276
Quantum Annealing approaches for Minimal Cut Set identification in fault trees
- 27 May 2026
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 276
Quantum Annealing approaches for Minimal Cut Set identification in fault trees
- Open Access
- 29 April 2026
- Published by Elsevier in SSRN Electronic Journal
Special Cases of the Joint Replenishment Problem (JRP): A Mathematical Analysis
Optimal solutions for the JRP are poorly understood, even for small instances. Starting from a mathematical definition of the JRP, we prove the existence of optimal policies while characterizing a space of policies which can achieve optimality. Further, we provide optimal solutions and exact evaluation formulas for special cases with either no holding costs, no minor order costs, or no major order cost.
- 29 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSpecial Cases of the Joint Replenishment Problem (JRP): A Mathematical Analysis
Optimal solutions for the JRP are poorly understood, even for small instances. Starting from a mathematical definition of the JRP, we prove the existence of optimal policies while characterizing a space of policies which can achieve optimality. Further, we provide optimal solutions and exact evaluation formulas for special cases with either no holding costs, no minor order costs, or no major order cost.
- Open Access
- 14 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (2) , 497-509
Discount replenishment opportunities with limited capacity: Optimal policy and pricing dynamics
- 14 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (2) , 497-509
Open AccessDiscount replenishment opportunities with limited capacity: Optimal policy and pricing dynamics
- 8 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (2) , 393-408
A parallel computing approach for scheduling Markovian project networks to maximize the expected net present value
- 8 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (2) , 393-408
A parallel computing approach for scheduling Markovian project networks to maximize the expected net present value
- Open Access
- 10 March 2026
- Published by Elsevier in SSRN Electronic Journal
Discount Replenishment Opportunities with Limited Capacity: Optimal Policy and Pricing Dynamics
We study an inventory model with occasional discounts on the fixed order cost, where a random capacity constraint limits the quantity ordered at the discount. We prove that the optimal policy resembles a can-order policy, characterized by a unique reorder, can-order, and order-up-to level. However, the random capacity constraints on the discount offers add complexity: the optimal policy features additional thresholds for inventory levels between the reorder and can-order point that determine when to use the discount. As these inventory-specific thresholds may render the optimal policy less straightforward to implement, we develop three heuristic replenishment policies inspired by the optimal policy structure. We compare their performance in a numerical study and derive an analytical bound on their worst-case optimality gaps in settings with an infinitely high backlog cost rate. With the buyer's optimal response to capacitated discounts in mind, we investigate the supplier's decision to set the discount price. A high discount relative to the regular order cost increases the probability that the buyer will accept the offer, but erodes the supplier's margin on discount sales and may reduce regular sales. We show that a mutually beneficial outcome requires buyer-to-supplier compensation.
- 10 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDiscount Replenishment Opportunities with Limited Capacity: Optimal Policy and Pricing Dynamics
We study an inventory model with occasional discounts on the fixed order cost, where a random capacity constraint limits the quantity ordered at the discount. We prove that the optimal policy resembles a can-order policy, characterized by a unique reorder, can-order, and order-up-to level. However, the random capacity constraints on the discount offers add complexity: the optimal policy features additional thresholds for inventory levels between the reorder and can-order point that determine when to use the discount. As these inventory-specific thresholds may render the optimal policy less straightforward to implement, we develop three heuristic replenishment policies inspired by the optimal policy structure. We compare their performance in a numerical study and derive an analytical bound on their worst-case optimality gaps in settings with an infinitely high backlog cost rate. With the buyer's optimal response to capacitated discounts in mind, we investigate the supplier's decision to set the discount price. A high discount relative to the regular order cost increases the probability that the buyer will accept the offer, but erodes the supplier's margin on discount sales and may reduce regular sales. We show that a mutually beneficial outcome requires buyer-to-supplier compensation.
- Open Access
- 8 March 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (2) , 429-450
Optimal product recovery strategies under competition
- 8 March 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (2) , 429-450
Open AccessOptimal product recovery strategies under competition
- 11 December 2025
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 383 (2310)
Limitations of quantum counting, nested quantum search and amplitude amplification and their potential to solve discrete optimization problems
Several quantum algorithms have been proposed for solving discrete optimization problems. In this paper, we focus on the quantum counting algorithm (QCB) of Brassard G, Høyer P, Tapp A. 1998 Quantum counting. In Automata, languages and programming (eds KG Larsen, S Skyum, G Winksel), pp. 820–831. Berlin Heidelberg, Berlin, Heidelberg: Springer. (doi:10.1007/BFb0055105), the nested quantum search algorithm of Cerf NJ, Grover LK, Williams CP. 2000 Nested quantum search and structured problems. Phys. Rev. 61. (doi:10.1103/physreva.61.032303), and amplitude amplification. We discuss potential limitations of these quantum algorithms and investigate how they can be used to solve discrete optimization problems. Our goal is to provide a set of practical guidelines that can help researchers to effectively implement Grover-based quantum algorithms. This article is part of the theme issue ‘Quantum theory and topology in models of decision making (Part 2)’.
- 11 December 2025
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 383 (2310)
Limitations of quantum counting, nested quantum search and amplitude amplification and their potential to solve discrete optimization problems
Several quantum algorithms have been proposed for solving discrete optimization problems. In this paper, we focus on the quantum counting algorithm (QCB) of Brassard G, Høyer P, Tapp A. 1998 Quantum counting. In Automata, languages and programming (eds KG Larsen, S Skyum, G Winksel), pp. 820–831. Berlin Heidelberg, Berlin, Heidelberg: Springer. (doi:10.1007/BFb0055105), the nested quantum search algorithm of Cerf NJ, Grover LK, Williams CP. 2000 Nested quantum search and structured problems. Phys. Rev. 61. (doi:10.1103/physreva.61.032303), and amplitude amplification. We discuss potential limitations of these quantum algorithms and investigate how they can be used to solve discrete optimization problems. Our goal is to provide a set of practical guidelines that can help researchers to effectively implement Grover-based quantum algorithms. This article is part of the theme issue ‘Quantum theory and topology in models of decision making (Part 2)’.
- 11 December 2025
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 383 (2310)
A hybrid column generation-based heuristic for solving the parallel machine scheduling problem with sequence-dependent set-up times
This study explores the application of a hybrid quantum-classical algorithm for solving the parallel machine scheduling problem (PMSP) with sequence-dependent set-up times, a pivotal scheduling problem that has applications in multiple industries. Using a column generation-based approach, we propose a heuristic that combines a classical linear relaxation for the master problem with quantum annealing (QA) for solving the pricing subproblem (PSP). Whereas the PSP generates columns (i.e. a sequence of jobs that are assigned to a machine), the master problem selects which columns to use in order to minimize the makespan of the schedule. To generate columns, the PSP solves a travelling salesman problem (TSP) that is formulated as a quadratic unconstrained binary optimization (QUBO) problem. The big advantage thereof is that subtours can be eliminated by use of quadratic terms in the objective function. In addition, our approach also leverages the quantum annealer’s capability to generate many high-quality solutions (i.e. columns) in a very short time. To assess the performance of our hybrid column generation-based heuristic, we perform a computational experiment. The results of this experiment demonstrate the synergy of hybrid methods for tackling complex decision-making problems, achieving competitive high-quality solutions and computational advantages when compared with classical solution methods. This article is part of the theme issue ‘Quantum theory and topology in models of decision making (Part 2)’.
- 11 December 2025
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 383 (2310)
A hybrid column generation-based heuristic for solving the parallel machine scheduling problem with sequence-dependent set-up times
This study explores the application of a hybrid quantum-classical algorithm for solving the parallel machine scheduling problem (PMSP) with sequence-dependent set-up times, a pivotal scheduling problem that has applications in multiple industries. Using a column generation-based approach, we propose a heuristic that combines a classical linear relaxation for the master problem with quantum annealing (QA) for solving the pricing subproblem (PSP). Whereas the PSP generates columns (i.e. a sequence of jobs that are assigned to a machine), the master problem selects which columns to use in order to minimize the makespan of the schedule. To generate columns, the PSP solves a travelling salesman problem (TSP) that is formulated as a quadratic unconstrained binary optimization (QUBO) problem. The big advantage thereof is that subtours can be eliminated by use of quadratic terms in the objective function. In addition, our approach also leverages the quantum annealer’s capability to generate many high-quality solutions (i.e. columns) in a very short time. To assess the performance of our hybrid column generation-based heuristic, we perform a computational experiment. The results of this experiment demonstrate the synergy of hybrid methods for tackling complex decision-making problems, achieving competitive high-quality solutions and computational advantages when compared with classical solution methods. This article is part of the theme issue ‘Quantum theory and topology in models of decision making (Part 2)’.
- 15 July 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
Dynamic programming in inventory management: A review
- 15 July 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
Dynamic programming in inventory management: A review
- 7 March 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 326 (1) , 13-27
Speeding up Grover’s algorithm
- 7 March 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 326 (1) , 13-27
Speeding up Grover’s algorithm