1. A computer-implemented method for optimizing web searching and scheduling of service providers, the method comprising the steps of: aggregating service providers and their services; checking, in real time, the availability information for the service providers; using the availability as a criterion for a schedule optimization; proposing one or more optimized series of services (schedule) for which there is availability; scheduling one or more series of events under various constraints; scoring each series of events that can thereby be ranked; assigning a score to each series of services that can thereby be ranked; aggregating additional data on the service providers including address, phone numbers, and reviews; providing information to define a request; checking that the information is consistent; rejecting errors in the information; requesting amended information if the information is not valid; determining if a preferred sequence of services was requested; generating a preferred sequence of services if one was not requested; generating a typical sequence of services; generating a solution sequence of services; retrieving a subset of matching service providers from the database using the defined constraints; redefining the base constraints on the service providers to broaden the search universe if there are not enough services available; building possible sequences; scores the possible sequences against the constraints; determining the best combinations of events matching the optimization criteria; assigning a score to each sequence; redefining the base constraints on the service providers to broaden the search universe if the optimization process has not found enough acceptable sequences; determining real time verification of service availability for the services; checking the availability of all the service providers used in each acceptable sequence; discarding a sequence if one service provider is not available; and returning the ordered sequences of services.