Comparison of Particle SWARM Optimization, Genetic Algorithm and Max separable Technique for Machine Time Scheduling Problem - Egyptian Knowledge Bank - troweb

29808

Comparison of Particle SWARM Optimization, Genetic Algorithm and Max separable Technique for Machine Time Scheduling Problem

Article

Last updated: 22 Jan 2023

Overview Similar Items

Article

Comparative Study of Intelligent Scheduling Algorithms for Heterogeneous Systems

Article

IMPACT OF GENETIC ALGORITHM OPERATORS ON ITS PERFORMANCE IN SOLVING FLOW SHOP SCHEDULING PROBL

Article

A Hybrid Evolutionary Algorithm for Solving Flexible Job Shop Scheduling Problem

Article

SOLVING RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM USING GENETIC ALGORITHM

Article

UNIT COMMITMENT USING PARTICLE SWARM. OPTIMIZATION TECHNIQUE

Article

SCHEDULING REAL-TIME TASKS IN MULTIPROCESSOR SYSTEMS USING GENETIC ALGORITHMS

Article

FLOW SHOP SCHEDULING USING GENETIC ALGORITHM: HISTORICAL REVIEW AND CATEGORIZATION OF PROCEDURE

Article

PARTICLE SWARM OPTIMIZATION TO IMPROVE A HYBRID HEURISTIC ALGORITHM FOR SOLVING CAPACITATED VEHICLE ROUTING PROBLEM

Article

Evaluation of Differential Evolution and Particle Swarm Optimization Algorithms at Training of Neural Network for prediction

Article

A MULTIOBJECTIVE DYNAMIC PARTICLE SWARM OPTIMIZER FOR ENVIRONMENTAL/ECONOMIC DISPATCH PROBLEM