We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, ...
Abstract. In-network processing emerges as an approach to reduce energy consumption in Wireless Sensor Networks (WSN) by decreasing the overall transferred data volume. Parallel pr...
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Execution cost of batched data mining queries can be reduced by integrating their I/O steps. Due to memory limitations, not all data mining queries in a batch can be executed toget...
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...