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 2016 · cs.DMShow all

1 paper · 2 filters

cs.DM2016

A fixed-parameter algorithm for a routing open shop problem: unit processing times, few machines and locations

René van Bevern, Artem V. Pyatkin

The open shop problem is to find a minimum makespan schedule to process each job $J_{i}$ on each machine $M_{q}$ for $p_{i q}$ time such that, at any time, each machine processes at mos…