On the public citation graph
A Discrete Particle Swarm Optimization Algorithm for Dynamic Scheduling of Transmission Tasks
Inferred edges come from two machine sources: sweeps of open repository
metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is
labelled with the one it came from. Neither is a complete citation index — absence here is not
evidence of absence.
1 of the 34 references listed on this page is in the Retraction Watch database as retracted (export 2026-11-18): 10.1007/s10586-018-2212-1 (notice 2022-01-18).
Dataset join, best-effort; this page does not check the publisher record.
Retraction Watch data via Crossref Labs, used with credit; OpenCitations Index (CC0) and Meta (CC BY 4.0);
dataset doi:10.7910/DVN/WT8VOA (CC BY 4.0).
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated
CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.3390/app11125333openalex-snapshotA Data-Driven Robust Scheduling Method Integrating Particle Swarm Optimization Algorithm with Kernel-Based Estimation
inferredcites →https://doi.org/10.3390/app12073340openalex-snapshotGenetic Algorithm versus Discrete Particle Swarm Optimization Algorithm for Energy-Efficient Moving Object Coverage Using Mobile Sensors
inferredcites →https://doi.org/10.3390/app12178503openalex-snapshotHybrid Discrete Particle Swarm Optimization Algorithm with Genetic Operators for Target Coverage Problem in Directional Wireless Sensor Networks
inferredcites →https://doi.org/10.3390/s150921033openalex-snapshotA Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.swevo.2026.102344openalex-snapshotSolving Dynamic Job Shop Scheduling Problems via an enhanced Proximal Policy Optimization algorithm with Double Prioritized Experience Replay
inferred← citeshttps://doi.org/10.3390/app16157595openalex-snapshotCentralized Evolutionary Optimization and Decentralized Agent-Based Scheduling for Open-Pit Mine Dispatching
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID:
icsacinstitute.org/submit.