Bilaloğlu, Ege2022-06-062022-06-062022-052022-052022-06http://hdl.handle.net/11693/80664Cataloged from PDF version of article.Thesis (Master's): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2022.Includes bibliographical references (leaves 102-106).Full duplex communication technology draws substantial interest among wireless network operators due to its ability to increase the network capacity through concurrent transmissions. Despite this advantage, interference issue caused by close distances between stations makes it challenging to integrate simultaneous transmit and receive mode into wireless networks. Motivated by the objective of minimal overhead in full duplex transmissions of access points, we provide an optimization framework to minimize the latest completion time of transmissions. In this problem, we aim to find an optimal schedule of transmissions that maximizes concurrent operations in order to reduce the makespan. We formulate the problem for both single and multiple concurrency assumptions separately. For single concurrency, we provide a mixed integer programming (MIP) model using scheduling based formulation along with a greedy heuristic. Modeling the problem as a matching problem between two disjoint sets of supplies and demands, we develop a linear programming (LP) model with a totally unimodular constraint matrix. We utilize Hopcroft-Karp algorithm for solving the resulting maximum cardinality bipartite matching problem. For multiple concurrency; we formulate a flow based integer programming model, demonstrate properties of the extreme points in its LP relaxation, develop valid inequalities and optimality cuts. As an extension, we add due dates for each station to complete their transmissions and formulate an MIP model and develop an algorithm for this variant. Additionally, we provide a proof for NP-completeness of minimum total tardiness problem with single concurrency. To evaluate the performance of the proposed formulations, we perform a range of computational experiments. Finally, we conduct sensitivity analyses to evaluate the effects of the parameters on the objective value and the solution times.x, 118 leaves : illustrations, charts ; 30 cm.Englishinfo:eu-repo/semantics/openAccessBroadcast schedulingMaximum cardinality matchingMathematical programmingDiscrete optimizationNetwork designThesisB161004