16 citations · 34 across the 7 of their papers we have counts for
10 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…
An improved decomposition-based heuristic for truck platooning
Boshuai Zhao, Roel Leus
Truck platooning is a promising transportation mode in which several trucks drive together and thus save fuel consumption by suffering less air resistance. In this paper, we consid…
The TSP with drones: The benefits of retraversing the arcs
Nicola Morandi, Roel Leus, Jannik Matuschke +1
In the Traveling Salesman Problem with Drones (TSP-mD), a truck and multiple drones cooperate to serve customers in the minimum amount of time. The drones are launched and retrieve…
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…
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…
Scheduling multiple agile Earth observation satellites with multiple observations
Xinwei Wang, Chao Han, Roel Leus
The Earth observation satellites (EOSs) are specially designed to collect images according to user requirements. The agile EOSs (AEOS), with stronger attitude maneuverability, grea…
A Combination of Flow Shop Scheduling and the Shortest Path Problem
Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon +1
This paper studies a combinatorial optimization problem which is obtained by combining the flow shop scheduling problem and the shortest path problem. The objective of the obtained…