A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling
The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
In recent years, both distributed scheduling problem and energy-efficient scheduling have attracted much attention. As the integration of these two problems, the distributed energy-efficient scheduling problem is of great realistic significance. To the best of our knowledge, the distributed energy-efficient parallel machines scheduling problem (DEPMSP) has not been studied yet. This article aims to solve DEPMSP by integrating factory assignment and machine assignment into an extended machine assignment to handle the coupled relations of subproblems. A knowledge-based two-population optimization (KTPO) algorithm is proposed to minimize total energy consumption and total tardiness simultaneously. Five properties are derived by analyzing the characteristics of DEPMSP. The population is initialized by using two heuristics based on problem-specific knowledge and a random heuristic. The nondominated sorting genetic algorithm-II and differential evolution perform cooperatively on the population in parallel. Moreover, two knowledge-based local search operators are proposed to enhance the exploitation. Extensive simulation experiments are conducted by comparing KTPO with four algorithms from the literature. The comparative results and statistical analysis demonstrate the effectiveness and advantages of KTPO in solving DEPMSP.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053 · cited 5×
“As classical metaheuristics, NSGA-II and DE have been successfully applied to many optimization problems including scheduling problems [44]–[56] and their”
MethodInfluentialStorn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569 · cited 1×
“DE has been successfully applied in solving continuous optimization problem [48] and scheduling problems [51]–[55].”
MethodDifferential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307 · cited 1×
“DE has been successfully applied in solving continuous optimization problem [48] and scheduling problems [51]–[55].”
MethodSPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008 · cited 9×
“As shown in Tables IV–VII, KTPO produces smaller DIR and bigger HV than the four comparative algorithms on all instances and ρ of NSGA-II, SPEA2, MOPSO, and TIPG are close to or equal to 0 on almost all instances, that is, four comparative algorithms cannot provide any members for reference set ∗; moreover, TS of KTPO…”
MethodInfluentialHandling multiple objectives with particle swarm optimization
Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826067 · Cited by 4,455 · cited 1×
“In this study, we compare KTPO with NSGA-II [44], strength Pareto evolutionary algorithm 2 (SPEA2) [68], multiobjective PSO (MOPSO) [69] with the idea of [70], and tabu-enhanced iterated Pareto greedy (TIPG) algorithm [71].”
MethodA scheduling model for reduced CPU energy
Yao, F., Demers, A. J., & Shenker, S. J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492493 · Cited by 1,457 · cited 1×
“scaling technique [30], [36], which is to adjust the processing”
BackgroundImproving Metaheuristic Algorithms With Information Feedback Models
Wang, G.-G., & Tan, Y. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2780274 · Cited by 285
A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop
Wang, J.-J., & Wang, L. (2020) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2017.2788879 · Cited by 279 · cited 2×
“To evaluate the performance of algorithm, four metrics, namely, DIR [65], hypervolume (HV) [66], ρ [67], and TS [23], are used.”
BackgroundMethodSelf-citationMultiobjective Flexible Job Shop Scheduling Using Memetic Algorithms
Yuan, Y., & Xu, H. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2013.2274517 · Cited by 270
Wang, Z.-J., Zhan, Z.-H., Yu, W.-J., Lin, Y., Zhang, J., Gu, T.-L., & Zhang, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2933499 · Cited by 257 · cited 1×
“lems, so we will pay attention to the applications of these algorithms with new mechanisms, such as learning [72] and feedback [73], to other distributed energy-efficient scheduling”
MethodA novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
Wang, L., Pan, Q.-K., Suganthan, P. N., Wang, W.-H., & Wang, Y.-M. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2008.12.004 · Cited by 254
Self-citationZhou, S., Xing, L., Zheng, X., Du, N., Wang, L., & Zhang, Q. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2939219 · Cited by 241 · cited 1×
“DE has been successfully applied in solving continuous optimization problem [48] and scheduling problems [51]–[55].”
MethodSelf-citationEvolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns
Han, Y., Gong, D., Jin, Y., & Pan, Q. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2771213 · Cited by 228
Multi-population techniques in nature inspired optimization algorithms: A comprehensive survey
Ma, H., Shen, S., Yu, M., Yang, Z., Fei, M., & Zhou, H. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.04.011 · Cited by 217 · cited 1×
“rithms, the multipopulation method is often embedded into it to improve its performances [39]–[41].”
MethodA memetic differential evolution algorithm for energy-efficient parallel machine scheduling
Wu, X., & Che, A. (2019) · Omega · doi:10.1016/j.omega.2018.01.001 · Cited by 214 · cited 11×
“the energy-efficient PMSP, Zheng and Wang [30] presented a job–speed pair-based coding method, in which job–speed pair (j, v) indicates that Jj is processed at speed velv.”
BackgroundMethodInfluentialLi, J.-Q., Song, M.-X., Wang, L., Duan, P., Han, Y., Sang, H., & Pan, Q.-K. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2943606 · Cited by 195
Self-citationGong, D., Han, Y., & Sun, J. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.02.029 · Cited by 179
A survey of multi-factory scheduling
Behnamian, J., & Ghomi, S. M. T. F. (2014) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-014-0890-y · Cited by 164 · cited 6×
“Behnamian and Ghomi [11] presented a survey on multifactory scheduling and provided the classification of distributed scheduling shown in Fig.”
BackgroundInfluentialLocal Binary Pattern-Based Adaptive Differential Evolution for Multimodal Optimization Problems
Zhao, H., Zhan, Z.-H., Lin, Y., Chen, X., Luo, X.-N., Zhang, J., Kwong, S., & Zhang, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2927780 · Cited by 163 · cited 1×
“As classical metaheuristics, NSGA-II and DE have been successfully applied to many optimization problems including scheduling problems [44]–[56] and their”
MethodEnergy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs
Che, A., Zhang, S., & Wu, X. (2017) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2017.04.018 · Cited by 148 · cited 1×
“[33] presented a model and designed a two-stage heuristic.”
MethodKimbrough, S. O., Koehler, G. J., Lu, M., & Wood, D. H. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2007.06.028 · Cited by 145
Wang, L., & Zheng, X.-L. (2017) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2017.06.001 · Cited by 143 · cited 1×
“metaheuristic, avoid useless search, and enable metaheuristics to be explored in promising regions [22], [32], [57], [58].”
BackgroundSelf-citationWang, G., Gao, L., Li, X., Li, P., & Tasgetiren, M. F. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100716 · Cited by 143 · cited 1×
“metaheuristic, avoid useless search, and enable metaheuristics to be explored in promising regions [22], [32], [57], [58].”
BackgroundEnergy efficient computing, clusters, grids and clouds: A taxonomy and survey
Zakarya, M., & Gillam, L. (2017) · Sustainable Computing Informatics and Systems · doi:10.1016/j.suscom.2017.03.002 · Cited by 91 · cited 2×
“The distributed energy-efficient parallel machines scheduling problem (DEPMSP) has many applications in manufacturing and service systems, such as energy-efficient cloud computing [5]– [8], [37], [38] and the PVC manufacturing process [12].”
BackgroundAfzalirad, M., & Rezaeian, J. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.10.039 · Cited by 80
Comparison of TFT-LCD and CRT on visual recognition and subjective preference
Chen, M.-T., & Lin, C.-C. (2004) · International Journal of Industrial Ergonomics · doi:10.1016/j.ergon.2004.02.003 · Cited by 69 · cited 1×
“computing [5]–[8], liquid crystal display [9], and food and”
BackgroundUnrelated parallel machine scheduling problem with energy and tardiness cost
Li, Z., Yang, H.-D., Zhang, S., & Liu, G. (2015) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-015-7657-2 · Cited by 67 · cited 2×
“[32] established a mathematical model and presented ten heuristics for minimizing total energy consumption and total tardiness.”
BackgroundAn efficient knowledge-based algorithm for the flexible job shop scheduling problem
Karimi, H., Rahmati, S. H. A., & Zandieh, M. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2012.04.001 · Cited by 66
Cai, X., Hu, M., Gong, D., Guo, Y., Zhang, Y., Fan, Z., & Huang, Y. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.05.007 · Cited by 45 · cited 4×
“Metric HV [66] is applied to measure the convergence and diversity.”
MethodInfluentialGraph colouring-based algorithm to parallel jobs scheduling on parallel factories
Behnamian, J. (2015) · International Journal of Computer Integrated Manufacturing · doi:10.1080/0951192x.2015.1099074 · Cited by 16 · cited 1×
“Behnamian [18] presented a two-phase algorithm with parti-”
Method
Cited by
AI Agents and Agentic AI–navigating a plethora of concepts for future manufacturing
Ren, Y., Liu, Y., Ji, T., & Xu, X. (2025) · Journal of Manufacturing Systems · doi:10.1016/j.jmsy.2025.08.017 · Cited by 66
Metadata
- Authors
- Pan, Z., Lei, D., & Wang, L.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2022-06
- Volume
- 52
- Issue
- 6
- Pages
- 5051-5063
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W3096926880
- Cited by
- 196
- References
- 30
- FWCI
- 9.91
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.