Article ID: | iaor20162396 |
Volume: | 19 |
Issue: | 3 |
Start Page Number: | 349 |
End Page Number: | 366 |
Publication Date: | Jun 2016 |
Journal: | Journal of Scheduling |
Authors: | Lisser Abdel, Adasme Pablo |
Keywords: | networks: scheduling, combinatorial optimization, allocation: resources |
In this paper, we present a deterministic resource allocation model for a hybrid uplink wireless orthogonal frequency and time division multiple access network. Since the input data of the model may be affected by uncertainty, we further consider a stochastic formulation of the problem which we transform into an equivalent deterministic binary second‐order conic program (SOCP). Subsequently, we use this binary SOCP to derive an equivalent integer linear programming formulation. The proposed models are aimed at maximizing the total bandwidth channel capacity subject to user power and sub‐carrier assignment constraints while simultaneously scheduling users in time. As such, the models are best suited for non‐real‐time applications where sub‐channel multiuser diversity can be further exploited simultaneously in frequency and time domains. Finally, in view of the large execution times required by CPLEX to solve the proposed models, we propose a variable neighborhood search metaheuristic procedure. Our numerical results show tight bounds and near optimal solutions for most of the instances when compared to the optimal solution of the problem. Moreover, we obtain better feasible solutions than CPLEX in the stochastic case. Finally, these bounds are obtained at a very low computational cost.