QoS-Based Web Service Scheduling Accommodating Inter-Service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm

In the field of semantic grid, QoS-based Web service scheduling for workflow optimization is an important problem. However, in a semantically and service-rich environment like the semantic Grid, the emergence of context constraints on Web services are very common. Scheduling should not only consider the quality properties of Web services, but also consider the inter-service dependencies which are caused by the context constraints imposed on Web services. In this paper, we present a repair genetic algorithm approach called minimal-conflict hill-climbing repairing genetic algorithm to address scheduling optimization problems in workflow applications in the presence of domain constraints and inter-service dependencies. Experimental results demonstrate the scalability and effectiveness of the approach.