— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Today, it is well understood that interference poses the main capacity limitation and thus challenge for future cellular networks. A promising concept that addresses interference i...
Fabian Diehm, Patrick Marsch, Gerhard Fettweis, Bh...