The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
Open accessAbstract
Rescheduling is a necessary procedure for a flexible job shop when newly arrived priority jobs must be inserted into an existing schedule. Instability measures the amount of change made to the existing schedule and is an important metrics to evaluate the quality of rescheduling solutions. This paper focuses on a flexible job-shop rescheduling problem (FJRP) for new job insertion. First, it formulates FJRP for new job insertion arising from pump remanufacturing. This paper deals with bi-objective FJRPs to minimize: 1) instability and 2) one of the following indices: a) makespan; b) total flow time; c) machine workload; and d) total machine workload. Next, it discretizes a novel and simple metaheuristic, named Jaya, resulting in DJaya and improves it to solve FJRP. Two simple heuristics are employed to initialize high-quality solutions. Finally, it proposes five objective-oriented local search operators and four ensembles of them to improve the performance of DJaya. Finally, it performs experiments on seven real-life cases with different scales from pump remanufacturing and compares DJaya with some state-of-the-art algorithms. The results show that DJaya is effective and efficient for solving the concerned FJRPs.
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 · cited 18×
“It means that NSGA-II, MOEA/D, and MOABC can just find some Pareto optimal solutions for case 1, since the proportion values of these three algorithms are less than 100.”
MethodInfluentialVenkata Rao, R. (2016) · International Journal of Industrial Engineering Computations · doi:10.5267/j.ijiec.2015.8.004 · Cited by 2,071
Production planning and control for remanufacturing: industry practice and research needs
Guide, V. D. R. (2000) · Journal of Operations Management · doi:10.1016/s0272-6963(00)00034-6 · Cited by 1,098
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Pezzella, F., Morganti, G., & Ciaschetti, G. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2007.02.014 · Cited by 1,014
Kacem, I., Hammadi, S., & Borne, P. (2002) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2002.1009117 · Cited by 788
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
Gao, J., Sun, L., & Gen, M. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2007.01.001 · Cited by 539
Li, J.-Q., Pan, Q.-K., & Tasgetiren, M. F. (2014) · Applied Mathematical Modelling · doi:10.1016/j.apm.2013.07.038 · Cited by 273
Self-citationThe Value of Quality Grading in Remanufacturing
Ferguson, M., Guide, V. D., Koca, E., & Souza, G. C. (2009) · Production and Operations Management · doi:10.1111/j.1937-5956.2009.01033.x · Cited by 262
Pareto-Optimization for Scheduling of Crude Oil Operations in Refinery via Genetic Algorithm
Hou, Y., Wu, N., Zhou, M., & Li, Z. (2017) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2015.2507161 · Cited by 246
Self-citationRobust scheduling for multi-objective flexible job-shop problems with random machine breakdowns
Xiong, J., Xing, L.-N., & Chen, Y.-W. (2013) · International Journal of Production Economics · doi:10.1016/j.ijpe.2012.04.015 · Cited by 228
Ahmadi, E., Zandieh, M., Farrokh, M., & Emami, S. M. (2016) · Computers & Operations Research · doi:10.1016/j.cor.2016.03.009 · Cited by 225
A new optimization algorithm for solving complex constrained design optimization problems
Rao, R. V., & Waghmare, G. (2016) · Engineering Optimization · doi:10.1080/0305215x.2016.1164855 · Cited by 210
TTSA: An Effective Scheduling Approach for Delay Bounded Tasks in Hybrid Clouds
Yuan, H., Bi, J., Tan, W., Zhou, M., Li, B. H., & Li, J. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2574766 · Cited by 207
Self-citationKang, Q., Feng, S., Zhou, M., Ammari, A. C., & Sedraoui, K. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2638898 · Cited by 203
Self-citationA Supervised Learning and Control Method to Improve Particle Swarm Optimization Algorithms
Dong, W., & Zhou, M. (2017) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2016.2560128 · Cited by 179
Self-citationGao, K. Z., Suganthan, P. N., Pan, Q. K., Chua, T. J., Cai, T. X., & Chong, C. S. (2014) · Information Sciences · doi:10.1016/j.ins.2014.07.039 · Cited by 176
Self-citationComposite Particle Swarm Optimizer With Historical Memory for Function Optimization
Li, J., Zhang, J., Jiang, C., & Zhou, M. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2424836 · Cited by 173
Self-citationProduction planning and control for remanufacturing: literature review and analysis
Junior, M. L., & Filho, M. G. (2012) · Production Planning & Control · doi:10.1080/09537287.2011.561815 · Cited by 165
Dimensional optimization of a micro-channel heat sink using Jaya algorithm
Rao, R. V., More, K. C., Taler, J., & Ocłoń, P. (2016) · Applied Thermal Engineering · doi:10.1016/j.applthermaleng.2016.04.135 · Cited by 165
Zheng, X.-L., & Wang, L. (2016) · International Journal of Production Research · doi:10.1080/00207543.2016.1170226 · Cited by 160
An artificial bee colony algorithm for multi-objective optimisation
Luo, J., Liu, Q., Yang, Y., Li, X., Chen, M.-R., & Cao, W. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.11.014 · Cited by 98
Gao, K., Zhang, Y., Sadollah, A., Lentzakis, A., & Su, R. (2017) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2017.05.002 · Cited by 88
Self-citation
Cited by
Chen, R., Yang, B., Li, S., & Wang, S. (2020) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.106778 · Cited by 548
Zhang, Y., Zhu, H., Tang, D., Zhou, T., & Gui, Y. (2022) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2022.102412 · Cited by 259
Metadata
- Authors
- Gao, K., Yang, F., Zhou, M., Pan, Q., & Suganthan, P. N.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2019-05
- Volume
- 49
- Issue
- 5
- Pages
- 1944-1955
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2801016318
- Cited by
- 302
- References
- 24
- FWCI
- 23.26
- Type
- journal article
- Language
- en
- Open access
- green
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.