A Comprehensive Web Service Selection Algorithm on Just-in-Time Scheduling

This paper proposes a comprehensive service selection algorithm (CSA) for improving performance and real-time arrangement in service selection. The algorithm integrates the service provider’s elicited preference and requestor’s planned time. This innovative CSA autonomously aggregates multiple requestors’ preferences over multicriteria from multiple providers, selecting the most suitable service provider on the basis of voting. The sequencing portion of the algorithm also runs based on time scheduling, where the extra cost of the system is minimal due to its small time window. The service arrangement process functions by identifying and utilizing the best solution for the 0-1 knapsack problem; the improved genetic algorithm finds solutions via coding and evolution. Experiment results show that the proposed CSA effectively simplifies the preference convergence of service requestors and optimizes the time scheduling of the service provider. The algorithm also enhances selection efficiency and reduces selection time, and it can be applied feasibly to multi-provider and multi-requestor service selection.