A variable neighbourhood search algorithm for the constrained task allocation problem

@article{Lusa2008AVN,
  title={A variable neighbourhood search algorithm for the constrained task allocation problem},
  author={Amaia Lusa and C. N. Potts},
  journal={JORS},
  year={2008},
  volume={59},
  pages={812-822}
}
A Variable Neighbourhood Search algorithm is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a finite capacity to be shared between the tasks it is assigned; (ii) the cost of solution includes fixed costs when using processors, assigning costs and communication costs between tasks assigned to different processors. A computational experiment shows that the algorithm is satisfactory in terms… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

A Hybrid Genetic/Optimization Algorithm for a Task Allocation Problem

  • A. B. Hadj-Alouane, J. C. Bean, K. G. Murty
  • Journal of Scheduling
  • 1999

Optimal synthesis of microcomputers for gm vehicles

  • K Rao
  • Technical Report
  • 1992

Similar Papers

Loading similar papers…