1. A computer implemented method for scheduling execution of work requests through work plan prioritization, the computer implemented method comprising: a processor mapping and assigning at least one work packet to each work request from a group of work requests; the processor deriving and assigning a complexity level to each work packet from said at least one work packet, wherein the complexity level is derived from an initial estimate for a duration of time, a number of resources, and resource skill requirements required for completing each work packet from said at least one work packet; the processor determining a priority level of each work request for each entity from a group of entities, wherein each priority level describes how urgent execution of a specific work request is to a particular entity from the group of entities; the processor determining a global priority for the group of work requests, wherein the global priority provides a preliminary ranking for ordering execution of the group of work requests, and wherein the global priority is determined for said group of work requests by factoring in a resource availability for executing each work request, a cost of executing each work request, a financial profit derived by each entity from the group of entities from executing each work request, and the priority level of each work request for each entity from the group of entities; the processor generating a priority function based on the global priority for the group of work requests and the complexity level assigned to each of the multiple work packets; and the processor scheduling execution of the work requests based on the priority function.