The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling
Abstract
This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness of the PSOMA. Additionally, the effects of some parameters on optimization performances are also discussed.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Scheduling: Theory, Algorithms, and Systems
(1996) · IIE Transactions · doi:10.1080/15458830.1996.11770714 · Cited by 6,210
Optimal two‐ and three‐stage production schedules with setup times included
Johnson, S. M. (1954) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800010110 · Cited by 3,252
Variable neighborhood search: Principles and applications
Hansen, P., & Mladenović, N. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00100-4 · Cited by 1,902
Genetic Algorithms and Random Keys for Sequencing and Optimization
Bean, J. C. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.2.154 · Cited by 1,543
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
Moscato, P. (1989) · Cited by 1,516
A multi-objective genetic local search algorithm and its application to flowshop scheduling
Ishibuchi, H., & Murata, T. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.704576 · Cited by 1,019
Cited by
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
Analysis of the Publications on the Applications of Particle Swarm Optimisation
Poli, R. (2008) · Journal of Artificial Evolution and Applications · doi:10.1155/2008/685175 · Cited by 651
Particle Swarm Optimization: Technique, System and Challenges
Palupi Rini, D., Mariyam Shamsuddin, S., & Sophiyati Yuhaniz, S. (2011) · International Journal of Computer Applications · doi:10.5120/1810-2331 · Cited by 390
Comparison of Three Evolutionary Algorithms: GA, PSO, and DE
Kachitvichyanukul, V. (2012) · Industrial Engineering and Management Systems · doi:10.7232/iems.2012.11.3.215 · Cited by 355
Fog Computing for Energy-Aware Load Balancing and Scheduling in Smart Factory
Wan, J., Chen, B., Wang, S., Xia, M., Li, D., & Liu, C. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2818932 · Cited by 322
Self-Adaptive Learning PSO-Based Deadline Constrained Task Scheduling for Hybrid IaaS Cloud
Zuo, X., Zhang, G., & Tan, W. (2014) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2013.2272758 · Cited by 289
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
Self-citationEdge and fog computing for IoT: A survey on current research activities & future directions
Laroui, M., Nour, B., Moungla, H., Cherif, M. A., Afifi, H., & Guizani, M. (2021) · Computer Communications · doi:10.1016/j.comcom.2021.09.003 · Cited by 275
Abdel-Basset, M., Manogaran, G., El-Shahat, D., & Mirjalili, S. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.03.020 · Cited by 262
RetractedConservation of Information in Search: Measuring the Cost of Success
Dembski, W. A., & Marks II, R. J. (2009) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2009.2025027 · Cited by 59
Minimalistic Attacks: How Little It Takes to Fool Deep Reinforcement Learning Policies
Qu, X., Sun, Z., Ong, Y.-S., Gupta, A., & Wei, P. (2021) · IEEE Transactions on Cognitive and Developmental Systems · doi:10.1109/tcds.2020.2974509 · Cited by 40
Metadata
- Authors
- Liu, B., Wang, L., & Jin, Y.-H.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 2007-02
- Volume
- 37
- Issue
- 1
- Pages
- 18-27
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2101097701
- Cited by
- 480
- References
- 27
- FWCI
- 66.03
- 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.