The traditional energy-saving evaluation method for industrial buildings is intended for all industrial buildings; however, substation buildings belong to a special category of industrial buildings, and their energy consumption characteristics are different from those of general industrial buildings. Consequently, it is necessary to establish an energy-saving evaluation system for substation buildings according to the characteristics of their energy consumption. In view of the issue that the energy consumption characteristics of substation buildings are different from those of other industrial buildings, an analytic hierarchy process (AHP) and fuzzy comprehensive evaluation (FCE) are used to establish a more comprehensive energy saving evaluation model that is more applicable to substation buildings. This paper determines 19 quantitative indicators and 13 qualitative indicators through the screening of relevant standards and norms, as well as the literature, and then determines the weight of each indicator by using AHP before finally establishing a secondary evaluation model based on FCE. In this paper, a substation in Shandong, China was selected as a case study to verify the proposed evaluation model, scoring 80.4 points, which falls within the “Good” grade. This method is of great significance for the future establishment of energy-saving evaluation system for substation buildings.

Cloud computing develops rapidly in recent years and provides service to many applications, in which job scheduling becomes more and more important to improve the quality of service. Parallel processing on cloud requires different machines starting simultaneously on the same job and brings processing slowdown due to communications overhead, defined as synchronization constraint and parallel slowdown. This paper investigates a new job scheduling problem of makespan minimization on uniform machines and identical machines with synchronization constraint and parallel slowdown. We first conduct complexity analysis proving that the problem is difficult in the face of adversarial job allocation. Then we propose a novel job scheduling algorithm, United Wrapping Scheduling (UWS), and prove that UWS admits an O(logm)-approximation for makespan minimization over m uniform machines. For the special case of identical machines, UWS is simplified to Sequential Allocation, Refilling and Immigration algorithm (SARI), proved to have a constant approximation ratio of 8 (tight up to a factor of 4). Performance evaluation implies that UWS and SARI have better makespan and realistic approximation ratio of 2 compared to baseline methods United-LPT and FIFO, and lower bounds.