Alternative Decomposition Based Approaches for Assigning Dusjunctive Tasks
Keywords:assignment, benders, branch-and-bound
AbstractWe consider a special linear assignment problem where some tasks are grouped, and in each group the tasks are disjunctive (in the sense that at most one of them could be performed). We show this problem NP-hard. Then we present and compare two alternative decomposition based algorithms on randomly generated instances.
How to Cite
Haddadi, S., & Slimani, O. (2007). Alternative Decomposition Based Approaches for Assigning Dusjunctive Tasks. Algorithmic Operations Research, 2(2), 129. Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/2452