The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem
Abstract
Group scheduling problems have attracted much attention owing to their many practical applications. This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time, release time, and due time. It is originated from an important industrial process, i.e., wire rod and bar rolling process in steel production systems. Two objective functions, i.e., the number of late jobs and total setup time, are minimized. A mixed integer linear program is established to describe the problem. To obtain its Pareto solutions, we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods, i.e., an insertion-based local search and an iterated greedy algorithm. The computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its peers. Its high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.
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
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Biobjective Task Scheduling for Distributed Green Data Centers
Yuan, H., Bi, J., Zhou, M., Liu, Q., & Ammari, A. C. (2021) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2019.2958979 · Cited by 138 · cited 1×
“A single machine scheduling problem with a time-dependent learning effect is studied in [18] to minimize Manuscript received September 12, 2020; revised October 23, 2020; accepted November 18, 2020.”
BackgroundSelf-citation
Cited by
Complex-Valued Neural Networks: A Comprehensive Survey
Lee, C., Hasegawa, H., & Gao, S. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.105743 · Cited by 289
Metadata
- Authors
- Zhao, Z., Liu, S., Zhou, M., & Abusorrah, A.
- Venue
- IEEE/CAA Journal of Automatica Sinica
- Published
- 2021-06
- Volume
- 8
- Issue
- 6
- Pages
- 1199-1209
- ISSN
- 2329-9266 (ISSN-L)
- 2329-9274
- OpenAlex
- W3115742705
- Cited by
- 203
- References
- 3
- FWCI
- 19.18
- 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: Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem. https://app.cochat.ai/papers/10.1109/jas.2020.1003539
- The paper
- Zhao, Z., Liu, S., Zhou, M., & Abusorrah, A. (2021). Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem. IEEE/CAA Journal of Automatica Sinica. https://doi.org/10.1109/jas.2020.1003539
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.