Cooperative metaheuristics for the permutation flowshop scheduling problem
From MaRDI portal
Publication:958077
DOI10.1016/J.EJOR.2007.11.049zbMATH Open1160.90488OpenAlexW1982956761MaRDI QIDQ958077FDOQ958077
Authors: Eva Vallada, Rubén Ruiz 
Publication date: 2 December 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.049
Recommendations
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Parallel hybrid heuristics for the permutation flow shop problem
- An adaptive hybrid metaheuristic for permutation flowshop scheduling
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- A comprehensive review and evaluation of permutation flowshop heuristics
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Parallel Metaheuristics
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Title not available (Why is that?)
- Scheduling in flowshops to minimize total tardiness of jobs
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- Flowshop scheduling research after five decades
- Scheduling flow shops using differential evolution algorithm
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Design and analysis of experiments.
- Focused Scheduling in Proportionate Flowshops
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Some Computer Organizations and Their Effectiveness
- Title not available (Why is that?)
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Parallel Processing and Applied Mathematics
- Parallel Programming
Cited In (13)
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
- Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- New hard benchmark for flowshop scheduling problems minimising makespan
- Parallel hybrid heuristics for the permutation flow shop problem
- The distributed permutation flowshop scheduling problem
- Flow shops with machine maintenance: ordered and proportionate cases
- A multi-agent based cooperative approach to scheduling and routing
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A cooperative hyper-heuristic search framework
- A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
This page was built for publication: Cooperative metaheuristics for the permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958077)
