On the partitioning of dynamic scheduling problems -: assigning technicians to areas

Y. Borenstein, Nazaraf Shah, E. Tsang, R. Dorne, A. Alsheddy, C. Voudouris

Research output: Contribution to conferencePaper

3 Citations (Scopus)
Original languageEnglish
Pages1691-1692
DOIs
Publication statusPublished - 2008

Bibliographical note

The full text of this item is not available from the repository. Paper presented at the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), held July 12-16, 2008, Atlanta, Georgia, USA
ACM post-print with statement © ACM, 2008. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO '08) {2008} http://dx.doi.org/10.1145/1389095.1389412

Keywords

  • dynamic scheduling problem

Cite this

Borenstein, Y., Shah, N., Tsang, E., Dorne, R., Alsheddy, A., & Voudouris, C. (2008). On the partitioning of dynamic scheduling problems -: assigning technicians to areas. 1691-1692. https://doi.org/10.1145/1389095.1389412