Some aspects of scatter search in the flow-shop problem
From MaRDI portal
Publication:2570162
DOI10.1016/j.ejor.2004.08.021zbMath1079.90058OpenAlexW1986945669MaRDI QIDQ2570162
Eugeniusz Nowicki, Czesław Smutnicki
Publication date: 26 October 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.08.021
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Makespan distribution of permutation flowshop schedules, A scatter search algorithm for the distributed permutation flowshop scheduling problem, Scatter search with path relinking for the job shop with time lags and setup times, A multi-objective particle swarm for a flow shop scheduling problem, Scatter search for minimizing weighted tardiness in a single machine scheduling with setups, A unified framework for population-based metaheuristics, A DE-based scatter search for global optimization problems, Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, Solving job shop scheduling problems utilizing the properties of backbone and ``big valley, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, Fast heuristics for minimizing the makespan in non-permutation flow shops, Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling, A new hybrid parallel genetic algorithm for the job‐shop scheduling problem, An empirical analysis of the optimality rate of flow shop heuristics, Scatter search --- wellsprings and challenges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the heuristic solution of the permutation flow shop problem by path algorithms
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Restricted neighborhood in the tabu search for the flowshop problem
- A fast tabu search algorithm for the permutation flow-shop problem
- Landscapes, operators and heuristic search
- A genetic algorithm for flowshop sequencing
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- Principles of scatter search
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- An Evaluation of Flow Shop Sequencing Heuristics
- New block properties for the permutation flow shop problem with application in tabu search
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
