A vibrant crossbreed social spider optimization with genetic algorithm tactic for flexible job shop scheduling problem
Job shop scheduling is one of the major issues in which the scheduling process is associated with the real-time manufacturing industry. A flexible job shop scheduling problem is one of the most important issues among the hardest combinatorial advancement issues. Flexible job shop scheduling is extre...
Main Authors: | S Kavitha, P Venkumar |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2020-01-01
|
Series: | Measurement + Control |
Online Access: | https://doi.org/10.1177/0020294019889085 |
Similar Items
-
An Optimal Genetic Algorithm for Flexible Job-shop Scheduling Problem
by: Chun-LiangLin, et al.
Published: (2011) -
OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS
by: Al-Hinai, Nasr
Published: (2011) -
OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS
by: Al-Hinai, Nasr
Published: (2011) -
Improved Genetic Algorithm Integrated with Scheduling Rules for Flexible Job Shop Scheduling Problems
by: Kamal Amjad Muhammad, et al.
Published: (2021-01-01) -
Unified Genetic Algorithm Approach for Solving Flexible Job-Shop Scheduling Problem
by: Jin-Sung Park, et al.
Published: (2021-07-01)