scientific article; zbMATH DE number 1998810

MaRDI QIDQ4433440zbMATH OpenFDO

Authors Adam Janiak, Krzysztof Chudzik, Marie-Claude Portmann

Publication date 15 December 2003

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A genetic algorithm for flow shop scheduling problems
• A genetic algorithm for the flowshop scheduling problem
• An improved genetic algorithm for the flowshop scheduling problem
• Genetic algorithms for the two-stage bicriteria flowshop problem
• A genetic algorithm for flowshop scheduling with multiple objectives
• A genetic algorithm for the job shop problem
• A comparative study of four genetic algorithm-based crossover operators for solving travelling salesman problem
• A heuristic genetic algorithm for flowshop scheduling
• Parallel Processing and Applied Mathematics
• Improved genetic algorithm for the permutation flowshop scheduling problem.

Cited in

(1)

• Genetic operators for the multiobjective flowshop problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4433440)