16 citations · 34 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
A pessimist's approach to one-sided matching
Tom Demeulemeester, Dries Goossens, Ben Hermans +1
Inspired by real-world applications such as the assignment of pupils to schools or the allocation of social housing, the one-sided matching problem studies how a set of agents can…