Biomimetic optimizers for job scheduling

Authors:
Czes$#322/aw Smutnicki
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wroc$#322/aw University of Technology, Wroc$#322/aw, Poland
Venue:
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Year:
2011

Citing 6
Cited 0

The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem

Computers and Operations Research
Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Tabu Search

Tabu Search
Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance

INFORMS Journal on Computing
Genetic algorithms, path relinking, and the flowshop sequencing problem

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, we proposed and tested a few biomimetic approaches for solving optimization problems derived from the practice of manufacturing. The main considered case is the cyclic flow shop scheduling problem with no-store constraints to minimize cycle time. Special problem properties are also shown. Quality of the proposed biomimetic optimization methods is evaluated in numerous computer tests.