We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has larg...
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
Yangyang Zhang, Chunlin Ji, Yi Liu, Wasim Q. Malik...
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...
Patrick van Bael, Dirk Devogelaere, Marcel Rijckae...
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...