Alternative Decomposition Based Approaches for Assigning Dusjunctive Tasks

Authors

  • Salim Haddadi
  • Omar Slimani

Keywords:

assignment, benders, branch-and-bound

Abstract

We 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.

Author Biographies

Salim Haddadi

Professor

Omar Slimani

Lecturer

Downloads

Published

2007-09-02

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

Issue

Vol. 2 No. 2 (2007)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.