On the public citation graph

An accurate and efficient parallel genetic algorithm to schedule tasks on a cluster

0 signed · 19 inferred · view as graph

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.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4615-4369-5openalex-snapshot
Efficient and Accurate Parallel Genetic Algorithms
inferredcites →https://doi.org/10.1007/978-1-4615-5065-5openalex-snapshot
Scheduling in Parallel Computing Systems
inferredcites →https://doi.org/10.1109/iecon.1990.149314openalex-snapshot
Efficient multiprocessor scheduling based on genetic algorithms
inferredcites →https://doi.org/10.1145/321941.321951openalex-snapshot
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-17509-6_3openalex-snapshot
Simulated Annealing Algorithm for Job Shop Scheduling on Reliable Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-981-15-0694-9_33openalex-snapshot
Distributed Processes Scheduling Based on Evolutionary Approach
inferred← citeshttps://doi.org/10.1016/j.parco.2003.12.005openalex-snapshot
An accurate parallel genetic algorithm to schedule tasks on a cluster
inferred← citeshttps://doi.org/10.1016/j.psep.2020.11.011openalex-snapshot
Optimal load scheduling for off-grid photovoltaic installations with fixed energy requirements and intrinsic constraints
inferred← citeshttps://doi.org/10.1109/cicsyn.2011.69openalex-snapshot
Utilizing Bee Colony to Solve Task Scheduling Problem in Distributed Systems
inferred← citeshttps://doi.org/10.1109/cit.2006.8openalex-snapshot
A Genetic-Annealing Algorithm for Task Scheduling Based on Precedence Task Duplication
inferred← citeshttps://doi.org/10.1109/cssim.2009.36openalex-snapshot
Using Simulated Annealing for Task Scheduling in Distributed Systems
inferred← citeshttps://doi.org/10.1109/ctrq.2009.29openalex-snapshot
A Novel Method for Task Scheduling in Distributed Systems Using Memetic
inferred← citeshttps://doi.org/10.1109/ical.2009.5262978openalex-snapshot
A new approach for task scheduling in distributed systems using learning automata
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536363openalex-snapshot
Distributed, heterogeneous resource management using artificial immune systems
inferred← citeshttps://doi.org/10.1201/9781420035063-16openalex-snapshot
Setting Parameter Values for Parallel Genetic Algorithms: Scheduling Tasks on a Cluster
inferred← citeshttps://doi.org/10.5120/5725-7792openalex-snapshot
A Novel Bee Colony Approach to Distributed Systems Scheduling
inferred← citeshttps://doi.org/10.5220/0004765000170026openalex-snapshot
Job Shop Scheduling and Co-Design of Real-Time Systems with Simulated Annealing
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.