Björn Schumacher
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Björn Schumacher has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Klaus Jansen
Kiel University
3 shared publications - Roberto Solis-Oba
Department of Computer Science, Western University, London, Canada
1 shared publication - Roberto Solis-Oba
Western University, London, Canada
1 shared publication - Tobias Mömke
University of Augsburg, Germany
1 shared publication
Latest Publications
- Open Access
- 6 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Faster EPTAS for Scheduling on Uniform Machines
- 6 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessFaster EPTAS for Scheduling on Uniform Machines
- 7 June 2026
- Published by Springer Nature
- p. 370-384
Hardness of SetCover Reoptimization
- Open Access
- 1 October 2025
- Published by Universitatsbibliothek Kiel
Faster EPTAS for Scheduling on Uniform Machines
We present an efficient polynomial-time approximation scheme (EPTAS) for the problem of scheduling jobs on parallel uniform machines that improves all previously known EPTAS for the problem. Our algorithm uses a Mixed Integer Linear Program (MILP) formulation for a relaxed version of the problem. We simplify the MILP by repeatedly removing carefully selected sets of jobs and machines until all integer variables have been removed. Then, we build up the solution through the use of a dynamic programming approach, enumeration, and linear program solving. Notable about our approach is that our algorithm only uses an LP solver, different from previous EPTAS approaches where MILP solvers are necessary.
- 1 October 2025
- Published by Universitatsbibliothek Kiel
Open AccessFaster EPTAS for Scheduling on Uniform Machines
We present an efficient polynomial-time approximation scheme (EPTAS) for the problem of scheduling jobs on parallel uniform machines that improves all previously known EPTAS for the problem. Our algorithm uses a Mixed Integer Linear Program (MILP) formulation for a relaxed version of the problem. We simplify the MILP by repeatedly removing carefully selected sets of jobs and machines until all integer variables have been removed. Then, we build up the solution through the use of a dynamic programming approach, enumeration, and linear program solving. Notable about our approach is that our algorithm only uses an LP solver, different from previous EPTAS approaches where MILP solvers are necessary.