Cloud Computing Resource Scheduling and a Survey of its Evolutionary Approaches - Zhan et al. 2015 In both academia and industry, the problem of cloud resource scheduling is seen to be as hard as a Nondeterministic Polynomial (NP) optimization problem, that is, an NP-hard problem, whose intractability increases exponentially with the number of variables if … Continue reading Cloud Computing Resource Scheduling and a Survey of its Evolutionary Approaches