On the public citation graph

Optimization of Makespan and Number of Operators for Flexible Job-Shop Scheduling Problems Using a Mono-Random Genetic Algorithm

https://doi.org/10.2139/ssrn.4810043
0 signed · 50 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-3-662-55305-3_2openalex-extracted
Review for Flexible Job Shop Scheduling
inferredcites →https://doi.org/10.1007/bf02238804openalex-extracted
Job-shop scheduling with multi-purpose machines
inferredcites →https://doi.org/10.1007/s00170-011-3610-1openalex-extracted
An effective artificial bee colony algorithm for the flexible job-shop scheduling problem
inferredcites →https://doi.org/10.1007/s00170-013-4923-zopenalex-extracted
A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions
inferredcites →https://doi.org/10.1007/s00521-021-06504-7openalex-extracted
Modified job shop scheduling via Taguchi method and genetic algorithm
inferredcites →https://doi.org/10.1007/s10845-007-0026-8openalex-extracted
Mathematical modeling and heuristic approaches to flexible job shop scheduling problems
inferredcites →https://doi.org/10.1007/s10845-015-1039-3openalex-extracted
An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem
inferredcites →https://doi.org/10.1007/s10845-015-1082-0openalex-extracted
A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility
inferredcites →https://doi.org/10.1007/s10845-015-1084-yopenalex-extracted
Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms
inferredcites →https://doi.org/10.1007/s11081-023-09842-8openalex-extracted
Flexible job-shop scheduling with limited flexible workers using an improved multiobjective discrete teaching–learning based optimization algorithm
inferredcites →https://doi.org/10.1007/s11431-022-2096-6openalex-extracted
Improved gray wolf optimizer for distributed flexible job shop scheduling problem
inferredcites →https://doi.org/10.1007/s12206-015-0242-7openalex-extracted
A new genetic algorithm for flexible job-shop scheduling problems
inferredcites →https://doi.org/10.1007/s40092-018-0280-8openalex-extracted
An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
inferredcites →https://doi.org/10.1016/0305-0548(93)e0015-lopenalex-extracted
A genetic algorithm for the job shop problem
inferredcites →https://doi.org/10.1016/j.cad.2010.12.015openalex-extracted
Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems
inferredcites →https://doi.org/10.1016/j.cie.2010.03.001openalex-extracted
Modelling worker fatigue and recovery in dual-resource constrained systems
inferredcites →https://doi.org/10.1016/j.cie.2019.106064openalex-extracted
Solving the flexible job shop scheduling problem using an improved Jaya algorithm
inferredcites →https://doi.org/10.1016/j.cie.2020.106778openalex-extracted
A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem
inferredcites →https://doi.org/10.1016/j.cor.2007.01.001openalex-extracted
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-extracted
A genetic algorithm for the Flexible Job-shop Scheduling Problem
inferredcites →https://doi.org/10.1016/j.cor.2023.106456openalex-extracted
Job-shop scheduling with limited flexible workers considering ergonomic factors using an improved multi-objective discrete Jaya algorithm
inferredcites →https://doi.org/10.1016/j.ejor.2004.04.020openalex-extracted
A heuristic to schedule flexible job-shop in a glass factory
inferredcites →https://doi.org/10.1016/j.eswa.2015.06.004openalex-extracted
A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion
inferredcites →https://doi.org/10.1016/j.eswa.2019.112902openalex-extracted
Energy-efficient flexible flow shop scheduling with worker flexibility
inferredcites →https://doi.org/10.1016/j.eswa.2022.119359openalex-extracted
Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system
inferredcites →https://doi.org/10.1016/j.ijpe.2016.01.016openalex-extracted
An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.ins.2016.08.046openalex-extracted
A shuffled multi-swarm micro-migrating birds optimizer for a multi-resource-constrained flexible job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.jclepro.2017.10.342openalex-extracted
A green scheduling algorithm for flexible job shop with energy-saving measures
inferredcites →https://doi.org/10.1016/j.jii.2021.100293openalex-extracted
Energy-efficient scheduling of flexible job shops with complex processes: A case study for the aerospace industry complex components in China
inferredcites →https://doi.org/10.1016/j.jii.2022.100350openalex-extracted
A hybrid metaheuristic solution approach for the cobot assignment and job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.jmsy.2021.05.018openalex-extracted
A hybrid Jaya algorithm for solving flexible job shop scheduling problem considering multiple critical paths
inferredcites →https://doi.org/10.1016/j.neucom.2013.10.042openalex-extracted
An effective teaching–learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time
inferredcites →https://doi.org/10.1016/j.omega.2022.102770openalex-extracted
Scheduling of Multi-Robot Job Shop Systems in Dynamic Environments: Mixed-Integer Linear Programming and Constraint Programming Approaches
inferredcites →https://doi.org/10.1016/s0378-4754(02)00019-8openalex-extracted
Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic
inferredcites →https://doi.org/10.1080/00207540601138510openalex-extracted
Worker flexibility in a parallel dual resource constrained job shop
inferredcites →https://doi.org/10.1080/00207543.2013.877613openalex-extracted
Considering skills evolutions in multi-skilled workforce allocation with flexible working hours
inferredcites →https://doi.org/10.1080/00207543.2016.1170226openalex-extracted
A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem
inferredcites →https://doi.org/10.1080/00207543.2019.1653504openalex-extracted
A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility
inferredcites →https://doi.org/10.1080/00207549508904809openalex-extracted
Managing worker flexibility and attrition in dual resource constrained job shops
inferredcites →https://doi.org/10.1080/0305215x.2022.2106477openalex-extracted
Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling
inferredcites →https://doi.org/10.1088/1757-899x/114/1/012060openalex-extracted
Flexible Job-Shop Scheduling with Dual-Resource Constraints to Minimize Tardiness Using Genetic Algorithm
inferredcites →https://doi.org/10.1109/coase.2009.5234153openalex-extracted
A particle swarm optimization algorithm for flexible job shop scheduling problem
inferredcites →https://doi.org/10.1109/tcyb.2018.2817240openalex-extracted
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
inferredcites →https://doi.org/10.1109/tcyb.2020.3026651openalex-extracted
A Modified Genetic Algorithm With New Encoding and Decoding Methods for Integrated Process Planning and Scheduling Problem
inferredcites →https://doi.org/10.1109/tcyb.2021.3069184openalex-extracted
Many-Objective Evolutionary Algorithm With Reference Point-Based Fuzzy Correlation Entropy for Energy-Efficient Job Shop Scheduling With Limited Workers
inferredcites →https://doi.org/10.1109/tsmcc.2002.1009117openalex-extracted
Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems
inferredcites →https://doi.org/10.1177/1687814018804096openalex-extracted
Solving the dual-resource constrained flexible job shop scheduling problem with learning effect by a hybrid genetic algorithm
inferredcites →https://doi.org/10.1504/ejie.2020.112479openalex-extracted
A hybrid genetic Tabu search algorithm for minimising total completion time in a flexible job-shop scheduling problem
inferredcites →https://doi.org/10.3390/app11146454openalex-extracted
Unified Genetic Algorithm Approach for Solving Flexible Job-Shop Scheduling Problem
inferredcites →https://doi.org/10.3390/machines9060108openalex-extracted
Dual Resource Constrained Flexible Job Shop Scheduling Based on Improved Quantum Genetic Algorithm
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.