On operators and search space topology in multi-objective flow shop scheduling

DOI10.1016/j.ejor.2006.06.010zbMath1121.90057OpenAlexW2135035157MaRDI QIDQ872256

Martin Josef Geiger

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.010

zbMATH Keywords

local searchmultiple objective programmingevolutionary computationsflow shop scheduling

Mathematics Subject Classification ID

Search theory (90B40) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items

Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling, An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem, Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems

Uses Software

• OR-Library

Cites Work

• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Landscapes, operators and heuristic search
• Benchmarks for shop scheduling problems
• A new adaptive multi-start technique for combinatorial global optimizations
• Metaheuristics for multiobjective optimisation
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• Solving multi-objective production scheduling problems using metaheuristics
• A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
• Benchmarks for basic scheduling problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Evolutionary Multi-Criterion Optimization
• Evolutionary Multi-Criterion Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item