Web services are becoming a major utility for accomplishing complex tasks over the Internet. In practice, the end‐users usually search for Web service compositions that best meet the quality of service (QoS) requirements (i.e., QoS global constraints). Since the number of services is constantly increasing and their respective QoS is inherently uncertain (due to environmental conditions), the task of selecting optimal compositions becomes more challenging. To tackle this problem, we propose a heuristic based on majority judgment that allows for reducing the search space. In addition, we perform a constraint programming search to select the Top K compositions that fulfill the QoS global constraints. The experimental results demonstrate the high performance of our approach.