Download A Solution Algorithm for Exploring Shop Scheduling Problems

Queue processing for download document Combinatorial optimization is widely used in assignment problems, such as traveling salesman problem (TSP), scheduling problems, et al. In this study, an evolutionary-based block model (EBBM) was proposed to enhance the speed of convergence so as to avoid

You can start your download in 30 seconds

Recommend Documents
A Discrete Invasive Weed Optimization Algorithm for the No-Wait Lot-Streaming Flow Shop Scheduling Problems

164 115 435KB

A Hybrid Particle Swarm Optimization Algorithm for Solving Job Shop Scheduling Problems

217 2 543KB

Job-Shop Scheduling Problem

188 31 888KB

Diversity of Processing Times in Permutation Flow Shop Scheduling Problems

176 111 15MB

A Discrete Artificial Immune System Algorithm for the Lot Streaming Flow Shop Scheduling Problem

160 7 41MB

A modified teaching learning metaheuristic algorithm with opposite-based learning for permutation flow-shop scheduling p

165 40 2MB

An Improved Local Search Genetic Algorithm with Multi-crossover for Job Shop Scheduling Problem

193 21 1MB

Computational Intelligence in Flow Shop and Job Shop Scheduling

221 56 4MB

Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor

172 85 4MB

Low carbon flexible job shop scheduling problem considering worker learning using a memetic algorithm

209 18 1MB

Improved approximation algorithms for two-stage flexible flow shop scheduling

181 70 485KB

An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling

161 97 860KB