1 citations · 1 across the 2 of their papers we have counts for
5 papers
A flow-based formulation for parallel machine scheduling using decision diagrams
Daniel Kowalczyk, Roel Leus, Christopher Hojny +1
We present a new flow-based formulation for identical parallel machine scheduling with a regular objective function and without idle time. The formulation is constructed with the h…
Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
Fan Yang, Morteza Davari, Wenchao Wei +2
We study the scheduling of jobs on a single parallel-batching machine with non-identical job sizes and incompatible job families. Jobs from the same family have the same processing…
Time-critical testing and search problems
Alessandro Agnetis, Ben Hermans, Roel Leus +1
This paper introduces a problem in which the state of a system needs to be determined through costly tests of its components by a limited number of testing units and before a given…
Exact algorithms for budgeted prize-collecting covering subgraph problems
Nicola Morandi, Roel Leus, Hande Yaman
We introduce a class of budgeted prize-collecting covering subgraph problems. For an input graph with prizes on the vertices and costs on the edges, the aim of these problems is to…
Exact and approximation algorithms for the expanding search problem
Ben Hermans, Roel Leus, Jannik Matuschke
Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a known probability distribution. The expanding search problem asks for a search sequence o…