On the public citation graph
Unified Genetic Algorithm Approach for Solving Flexible Job-Shop Scheduling Problem
0 signed · 68 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.
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.1007/bf01719451openalex-snapshot
Tabu search for the job-shop scheduling problem with multi-purpose machines
inferredcites →https://doi.org/10.1007/s00170-009-2388-xopenalex-snapshot
A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups
inferredcites →https://doi.org/10.1007/s00170-010-2642-2openalex-snapshot
A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem
inferredcites →https://doi.org/10.1007/s10462-017-9605-zopenalex-snapshot
Metaheuristic research: a comprehensive survey
inferredcites →https://doi.org/10.1007/s11042-014-1965-7openalex-snapshot
Developing a job shop scheduling system through integration of graphic user interface and genetic algorithm
inferredcites →https://doi.org/10.1007/s11042-020-10139-6openalex-snapshot
A review on genetic algorithm: past, present, and future
inferredcites →https://doi.org/10.1007/s11277-018-5740-3openalex-snapshot
Genetic Algorithms for Solving Shortest Path Problem in Maze-Type Network with Precedence Constraints
inferredcites →https://doi.org/10.1007/s12083-019-00808-1openalex-snapshot
Interactive job sequencing system for small make-to-order manufacturers under smart manufacturing environment
inferredcites →https://doi.org/10.1007/s12206-015-0242-7openalex-snapshot
A new genetic algorithm for flexible job-shop scheduling problems
inferredcites →https://doi.org/10.1016/0305-0548(93)e0024-nopenalex-snapshot
Genetic algorithm crossover operators for ordering applications
inferredcites →https://doi.org/10.1016/0360-8352(96)00047-2openalex-snapshot
A tutorial survey of job-shop scheduling problems using genetic algorithms—I. representation
inferredcites →https://doi.org/10.1016/j.compchemeng.2013.12.001openalex-snapshot
Scope for industrial applications of production scheduling models and solution methods
inferredcites →https://doi.org/10.1016/j.cor.2007.01.001openalex-snapshot
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
inferredcites →https://doi.org/10.1016/j.cor.2007.02.014openalex-snapshot
A genetic algorithm for the Flexible Job-shop Scheduling Problem
inferredcites →https://doi.org/10.1016/j.eswa.2010.08.145openalex-snapshot
An effective genetic algorithm for the flexible job-shop scheduling problem
inferredcites →https://doi.org/10.1016/j.eswa.2015.08.003openalex-snapshot
Effective hierarchical optimization by a hierarchical multi-space competitive genetic algorithm for the flexible job-shop scheduling problem
inferredcites →https://doi.org/10.1016/j.ifacol.2015.06.196openalex-snapshot
Integrating Genetic Algorithm with Time Control for Just-In-Time Scheduling Problems
inferredcites →https://doi.org/10.1016/j.ifacol.2015.06.373openalex-snapshot
Assessment of makespan performance for flexible process plans in job shop scheduling
inferredcites →https://doi.org/10.1016/j.swevo.2020.100664openalex-snapshot
An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints
inferredcites →https://doi.org/10.1016/s0360-8352(99)00136-9openalex-snapshot
A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies
inferredcites →https://doi.org/10.1080/00207540902814348openalex-snapshot
A genetic algorithm for flexible job shop scheduling with fuzzy processing time
inferredcites →https://doi.org/10.1080/00207543.2014.962113openalex-snapshot
A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel VNS execution
inferredcites →https://doi.org/10.1080/00207543.2020.1718794openalex-snapshot
Production scheduling in the context of Industry 4.0: review and trends
inferredcites →https://doi.org/10.1109/access.2015.2481463openalex-snapshot
Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic Algorithm
inferredcites →https://doi.org/10.1109/icisce.2015.36openalex-snapshot
An Improved Genetic Algorithm for Flexible Job Shop Scheduling Problem
inferredcites →https://doi.org/10.1111/itor.12199openalex-snapshot
A research survey: review of flexible job shop scheduling techniques
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1155/2017/1527858openalex-snapshot
A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm
inferredcites →https://doi.org/10.1166/asl.2017.10466openalex-snapshot
Performance Comparison of Neighborhood Structures of Tabu Search Algorithms for Sequencing Problems
inferredcites →https://doi.org/10.12785/amis/080562openalex-snapshot
A Job Shop Scheduling Game with GA-based Evaluation
inferredcites →https://doi.org/10.5281/zenodo.1098020openalex-snapshot
Optimization Of Flexible Job Shop Scheduling Problem With Sequence Dependent Setup Times Using Genetic Algorithm Approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4810043openalex-extracted
Optimization of Makespan and Number of Operators for Flexible Job-Shop Scheduling Problems Using a Mono-Random Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-98304-7_48openalex-snapshot
A Fuzzy Multi-objective Modified Pareto Simulated Annealing Approach for Flexible Job Shop Scheduling Problems
inferred← citeshttps://doi.org/10.1007/s12351-025-00977-3openalex-snapshot
Panoptic migrating birds optimization with GCN-guided population iteration: a feature-guided intelligent optimizer (FGIO) for flexible job shop scheduling
inferred← citeshttps://doi.org/10.1007/s12517-022-11075-5openalex-snapshot
Solution of the inverse analysis problem in geotechnics using stochastic methods—application to a pressuremeter test
inferred← citeshttps://doi.org/10.1007/s12555-023-0578-1openalex-snapshot
A Review on Intelligent Scheduling and Optimization for Flexible Job Shop
inferred← citeshttps://doi.org/10.1007/s41019-025-00314-wopenalex-snapshot
A Cost-Saving Response Scheduler for Highway Structural Health Monitoring Data Applications
inferred← citeshttps://doi.org/10.1007/s44443-025-00283-0openalex-snapshot
A genetic-operator-integrated whale optimization algorithm for solving the flexible job shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107503openalex-snapshot
A dual-heuristic crossover genetic algorithm with variable neighborhood search for flexible job shop scheduling with transportation times
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125888openalex-snapshot
A genetic algorithm enhanced with neighborhood structure for general flexible job shop scheduling with parallel batch processing machine
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.128138openalex-snapshot
Driving energy efficiency in scheduling manufacturing: An advanced instance generation and a metaheuristic approach
inferred← citeshttps://doi.org/10.1016/j.matpr.2022.08.263openalex-snapshot
Opposition based genetic optimization algorithm with Cauchy mutation for job shop scheduling problem
inferred← citeshttps://doi.org/10.1038/s41598-025-33859-xopenalex-snapshot
Hybrid Grey Wolf Optimizer with discrete prism dispersion strategy for solving flexible job-shop scheduling problem
inferred← citeshttps://doi.org/10.1049/cim2.12102openalex-snapshot
Research on joint scheduling method of order grading and machine maintenance
inferred← citeshttps://doi.org/10.1049/cim2.70028openalex-snapshot
A Novel DQN‐Based Hybrid Algorithm for Integrated Scheduling and Machine Maintenance in Dynamic Flexible Job Shops
inferred← citeshttps://doi.org/10.1080/10447318.2025.2610447openalex-snapshot
Novel Visualization XAI Techniques for Assisting Schedulers’ Comprehension and Interpretation of ACO Applications in Job Scheduling
inferred← citeshttps://doi.org/10.1080/23302674.2025.2573992openalex-snapshot
Flexible job shop scheduling using Jaya-Tabu search algorithm
inferred← citeshttps://doi.org/10.1109/icecai62591.2024.10675292openalex-snapshot
A Deep Reinforcement Learning Method for Flexible Job-Shop Scheduling Problem
inferred← citeshttps://doi.org/10.1109/tevc.2022.3222791openalex-snapshot
A Novel Evolutionary Algorithm for Energy-Efficient Scheduling in Flexible Job Shops
inferred← citeshttps://doi.org/10.1111/itor.70263openalex-snapshot
A genetic algorithm for scheduling an automated machine cell with tool and pallet–fixture setups
inferred← citeshttps://doi.org/10.1142/s0218126623503188openalex-snapshot
Research on Dynamic Task Scheduling of Transmission and Generation of Schedule Based on Improved Genetic Algorithm
inferred← citeshttps://doi.org/10.1155/2022/9191247openalex-snapshot
Multipopulation GA/IWO with Coupled Scale-Free Networks for Solving Flexible Job-Shop Scheduling Problems
inferred← citeshttps://doi.org/10.24002/ijis.v5i2.6871openalex-snapshot
Priority Scheduling Implementation for Exam Schedule
inferred← citeshttps://doi.org/10.32604/cmes.2023.028098openalex-snapshot
A Novel Collaborative Evolutionary Algorithm with Two-Population for Multi-Objective Flexible Job Shop Scheduling
inferred← citeshttps://doi.org/10.33633/tc.v22i1.7049openalex-snapshot
Implementasi Algoritma Genetika untuk Aplikasi Penjadwalan Sistem Kerja Shift
inferred← citeshttps://doi.org/10.3390/app11199193openalex-snapshot
Scheduling of Single-Arm Cluster Tools with Residency Time Constraints and Chamber Cleaning Operations
inferred← citeshttps://doi.org/10.3390/app12062829openalex-snapshot
Embedded PSO for Solving FJSP on Embedded Environment (Industry 4.0 Era)
inferred← citeshttps://doi.org/10.3390/app12063011openalex-snapshot
Algorithms and Methods for Designing and Scheduling Smart Manufacturing Systems
inferred← citeshttps://doi.org/10.3390/app13064058openalex-snapshot
Research on Transmission Task Static Allocation Based on Intelligence Algorithm
inferred← citeshttps://doi.org/10.3390/app13074353openalex-snapshot
A Discrete Particle Swarm Optimization Algorithm for Dynamic Scheduling of Transmission Tasks
inferred← citeshttps://doi.org/10.3390/asi6010015openalex-snapshot
A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems
inferred← citeshttps://doi.org/10.3390/en15093300openalex-snapshot
A Fuzzy-Genetic-Based Integration of Renewable Energy Sources and E-Vehicles
inferred← citeshttps://doi.org/10.3390/machines9120344openalex-snapshot
Adaptive Population NSGA-III with Dual Control Strategy for Flexible Job Shop Scheduling Problem with the Consideration of Energy Consumption and Weight
inferred← citeshttps://doi.org/10.3390/math14020307openalex-snapshot
Application of a Reinforcement Learning-Based Improved Genetic Algorithm in Flexible Job-Shop Scheduling Problems
inferred← citeshttps://doi.org/10.3390/pr10030571openalex-snapshot
Dynamic Self-Learning Artificial Bee Colony Optimization Algorithm for Flexible Job-Shop Scheduling Problem with Job Insertion
inferred← citeshttps://doi.org/10.4108/eetsis.2913openalex-snapshot
Mitigation of Make Span Time in Job Shop Scheduling Problem Using Gannet Optimization Algorithm
inferred← citeshttps://doi.org/10.54489/ijbas.v5i1.558openalex-snapshot
AI-Augmented Manufacturing: A CPMAI Lifecycle Approach to Enhancing Planning Accuracy, Scheduling Efficiency, and Decision Support
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.