René van Bevern

activity

20092026

most citedParameterized complexity of machine scheduling: 15 open problems

66 citations · 457 across the 33 of their papers we have counts for

collaborators

Showing math.OCShow all

2 papers · 1 filter

math.OC2017★ 66 cited

Parameterized complexity of machine scheduling: 15 open problems

Matthias Mnich, René van Bevern

Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To sti…

math.OC2016

Precedence-constrained scheduling problems parameterized by partial order width

René van Bevern, Robert Bredereck, Laurent Bulteau +3

Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec, $p_{j} \in {1, 2}$ | $C_{m a x}$ , the problem of finding a non-preempti…