A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling
The DOI matches its Crossref record; 3 of the 3 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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Differential 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 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
- 3
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling. https://app.cochat.ai/papers/10.1109/tcyb.2020.3026571
- The paper
- Pan, Z., Lei, D., & Wang, L. (2022). A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2020.3026571
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.