The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,371
Complexity of Machine Scheduling Problems
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70743-x · Cited by 2,197
Design and Analysis of Experiments: Special Designs and Applications
(2012) · Wiley Series in Probability and Statistics · doi:10.1002/9781118147634 · Cited by 2,031
The Shifting Bottleneck Procedure for Job Shop Scheduling
Adams, J., Balas, E., & Zawack, D. J. (1988) · Management Science · doi:10.1287/mnsc.34.3.391 · Cited by 1,603
A Fast Taboo Search Algorithm for the Job Shop Problem
Nowicki, E., & Smutnicki, C. (1996) · Management Science · doi:10.1287/mnsc.42.6.797 · Cited by 976
Deterministic job-shop scheduling: Past, present and future
Jain, A. S., & Meeran, S. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00113-1 · Cited by 782
Operational methods for minimization of energy consumption of manufacturing equipment
Mouzon, G., Yildirim, M. B., & Twomey, J. (2007) · International Journal of Production Research · doi:10.1080/00207540701450013 · Cited by 597
Priority Rules for Job Shops with Weighted Tardiness Costs
Vepsalainen, A. P. J., & Morton, T. E. (1987) · Management Science · doi:10.1287/mnsc.33.8.1035 · Cited by 577
Cited by
Review of job shop scheduling research and its new perspectives under Industry 4.0
Zhang, J., Ding, G., Zou, Y., Qin, S., & Fu, J. (2019) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-017-1350-2 · Cited by 558
Li, J.-Q., Sang, H.-Y., Han, Y.-Y., Wang, C.-G., & Gao, K.-Z. (2018) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2018.02.004 · Cited by 295
Lu, C., Gao, L., Li, X., Pan, Q., & Wang, Q. (2017) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2017.01.011 · Cited by 292
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
A review of energy-efficient scheduling in intelligent production systems
Gao, K., Huang, Y., Sadollah, A., & Wang, L. (2020) · Complex & Intelligent Systems · doi:10.1007/s40747-019-00122-6 · Cited by 274
Metadata
- Authors
- Zhang, R., & Chiong, R.
- Venue
- Journal of Cleaner Production
- Publisher
- Elsevier BV
- Published
- 2016-01
- Volume
- 112
- Pages
- 3361-3375
- ISSN
- 0959-6526 (ISSN-L)
- OpenAlex
- W1810830047
- Cited by
- 344
- References
- 20
- FWCI
- 42.17
- 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: Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. https://app.cochat.ai/papers/10.1016/j.jclepro.2015.09.097
- The paper
- Zhang, R., & Chiong, R. (2016). Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. Journal of Cleaner Production. https://doi.org/10.1016/j.jclepro.2015.09.097
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.