SciELO - Scientific Electronic Library Online

vol.24 issue3The effects of parameter estimation on minimising the in-control average sample size for the double sampling x̅ chartThe robust min-max newsvendor problem with balking under a service level constraint author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand



Related links

  • On index processCited by Google
  • On index processSimilars in Google


South African Journal of Industrial Engineering

On-line version ISSN 2224-7890
Print version ISSN 1012-277X


SELLAMI, K.; AHMED-NACER, M.; TIAKO, P.F.  and  CHELOUAH, R.. Immune genetic algorithm for scheduling service workflows with QoS constraints in cloud computing. S. Afr. J. Ind. Eng. [online]. 2013, vol.24, n.3, pp.68-82. ISSN 2224-7890.

Resources allocation and scheduling of service workflows is an important challenge in distributed computing. This is particularly true in a cloud computing environment, where many computer resources may be available at specified locations, as and when required. Quality-of-service (QoS) issues such as execution time and running costs must also be considered. Meeting this challenge requires that two classic computational problems be tackled. The first problem is allocating resources to each of the tasks in the composite web services or workflow. The second problem involves scheduling resources when each resource may be used by more than one task, and may be needed at different times. Existing approaches to scheduling workflows or composite web services in cloud computing focus only on reducing the constraint problem - such as the deadline constraint, or the cost constraint (bi-objective optimisation). This paper proposes a new genetic algorithm that solves a scheduling problem by considering more than two constraints (multi-objective optimisation). Experimental results demonstrate the effectiveness and scalability of the proposed algorithm.

        · abstract in Afrikaans     · text in English     · English ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License