A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.

DOI10.1016/S0305-0548(02)00059-XzbMath1039.90015MaRDI QIDQ1423450

Jeffery K. Cochran, John W. Fowler, Shwu-Min Horng

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Genetic algorithms; Multiple objectives; Parallel machine scheduling

Mathematics Subject Classification ID

90B50: Management decision making, including multiple objectives

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Hybrid flowshop scheduling with machine and resource-dependent processing times, A united search particle swarm optimization algorithm for multiobjective scheduling problem, A multi-criteria approach for scheduling semiconductor wafer fabrication facilities, The Pareto fitness genetic algorithm: test function study, Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems, Research on quality performance conceptual design based on SPEA2+, Best compromise solution for a new multiobjective scheduling problem, A multiobjective evolutionary algorithm for scheduling and inspection planning in software development projects, A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem, A genetic algorithm for a bicriteria supplier selection problem

Cites Work

• A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
• A comparison of neighborhood search techniques for multi-objective combinatorial problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item