A workflow aggregates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can contain atomic and other CWS they encourage the development of service layers and reuse of already existing functionality. However deployment of the service compositions becomes possible only after an adequate performance of CWS is assured. Due to the constantly increasing complexity of the underlying services interaction, a CWS can exhibit problematic and often difficult to predict behaviours in overload situations. This paper focuses on the use of request scheduling for improving CWS performance in overload situations. Scheduling policies namely Shortest Job First, Least Work Reaming, Total Work and Fewest Operations remaining are studied in regards to their effectiveness in helping with constant and fluctuating loads.