Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Genetic Programming with Tabu List for Dynamic Flexible Job Shop Scheduling.

Evolutionary computation - 1 Mar 2026

Zhang Fangfang, Ardeh Mazhar Ansari, Mei Yi, Zhang Mengjie

Abstract excerpt

Dynamic flexible job shop scheduling (DFJSS) is an important combinatorial optimisation problem, requiring simultaneous decision-making for machine assignment and operation sequencing in dynamic environments. Genetic programming (GP), as a hyper-heuristic approach, has been extensively employed for acquiring scheduling heuristics for DFJSS. A drawback of GP for DFJSS is that GP has weak exploration ability...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Models, Genetic
Share to Phenotype

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Source

Identifiers

PMID: 40367324
DOI: 10.1162/EVCO.a.26

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 5 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Genetic Programming with Tabu List for Dynamic Flexible Job Shop Scheduling.PMID 40367324Read ↗

An Adaptive Memetic Algorithm for the Joint Allocation of Heterogeneous Stochastic Resources.Semantic proximity Read ↗

A graph-based evolutionary algorithm: Genetic Network Programming (GNP) and its extension using reinforcement learning.Semantic proximity Read ↗

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.Semantic proximity Read ↗

Naturally selecting solutions: the use of genetic algorithms in bioinformatics.Semantic proximity Read ↗

Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.Semantic proximity Read ↗

Beautiful Mind: a meta-heuristic algorithm for generating minimal covering arraySemantic proximity Read ↗

Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.Semantic proximity Read ↗

Heap Based Optimizer Algorithm for Solving Feature Selection Problems in High-Dimensional Cancer Microarray DataSemantic proximity Read ↗

Re-inspiring the genetic algorithm with multi-level selection theory: multi-level selection genetic algorithm.Semantic proximity Read ↗

Constrained evolutionary optimization by means of (μ + λ)-differential evolution and improved adaptive trade-off model.Semantic proximity Read ↗

Internal lattice reconfiguration for diversity tuning in Cellular Genetic Algorithms.Semantic proximity Read ↗

RGFGA: an efficient representation and crossover for grouping genetic algorithms.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.