Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature,...
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, ...
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
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, ...
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...