Janis Brammer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Janis Brammer has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Bernhard Lutz
University of Freiburg
2 shared publications - Dirk Neumann
University of Freiburg
2 shared publications Bernhard Lutz
1 shared publicationDirk Neumann
1 shared publication- Mirko Stappert1 shared publication
Latest Publications
- Open Access
- 11 December 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 332 (1) , 52-65
Solving the paint shop problem with flexible management of multi-lane buffers using reinforcement learning and action masking
- 11 December 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 332 (1) , 52-65
Open AccessSolving the paint shop problem with flexible management of multi-lane buffers using reinforcement learning and action masking
- 1 May 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 299 (1) , 75-86
Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- 1 May 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 299 (1) , 75-86
Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- Open Access
- 28 September 2021
- Published by Springer Nature in OR Spectrum
- Vol. 44 (1) , 29-56
Stochastic mixed model sequencing with multiple stations using reinforcement learning and probability quantiles
In this study, we propose a reinforcement learning (RL) approach for minimizing the number of work overload situations in the mixed model sequencing (MMS) problem with stochastic processing times. The learning environment simulates stochastic processing times and penalizes work overloads with negative rewards. To account for the stochastic component of the problem, we implement a state representation that specifies whether work overloads will occur if the processing times are equal to their respective 25%, 50%, and 75% probability quantiles. Thereby, the RL agent is guided toward minimizing the number of overload situations while being provided with statistical information about how fluctuations in processing times affect the solution quality. To the best of our knowledge, this study is the first to consider the stochastic problem variation with a minimization of overload situations.
- 28 September 2021
- Published by Springer Nature in OR Spectrum
- Vol. 44 (1) , 29-56
Open AccessStochastic mixed model sequencing with multiple stations using reinforcement learning and probability quantiles
In this study, we propose a reinforcement learning (RL) approach for minimizing the number of work overload situations in the mixed model sequencing (MMS) problem with stochastic processing times. The learning environment simulates stochastic processing times and penalizes work overloads with negative rewards. To account for the stochastic component of the problem, we implement a state representation that specifies whether work overloads will occur if the processing times are equal to their respective 25%, 50%, and 75% probability quantiles. Thereby, the RL agent is guided toward minimizing the number of overload situations while being provided with statistical information about how fluctuations in processing times affect the solution quality. To the best of our knowledge, this study is the first to consider the stochastic problem variation with a minimization of overload situations.