Web services sharing in batch service composition

The problem of the batch web services composition is defined in this paper. Web service composition is extended to the situation when a user requests implementation of several service compositions in one batch. The problem is modeled as linear optimization with constrains on the network. A network of structured web services is assumed to be given for each task from the batch. These networks may share web services that cannot be performed simultaneously. Overcoming collision on shared web service, a schedule of jobs on single machine has to be found. The paper presents exact and heuristic algorithms for designing the schedule and exploiting this schedule in exact and genetic algorithms solving the problem of batch web services composition. The result may be applied in business distributed systems for web service preprocessing.