Cooperative metaheuristics for the permutation flowshop scheduling problem
From MaRDI portal
Publication:958077
DOI10.1016/J.EJOR.2007.11.049zbMATH Open1160.90488OpenAlexW1982956761MaRDI QIDQ958077FDOQ958077
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
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 2086794 (Why is no real title available?)
- 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 simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Benchmarks for basic scheduling problems
- Design and analysis of experiments.
- Flowshop scheduling research after five decades
- Focused Scheduling in Proportionate Flowshops
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Optimal two- and three-stage production schedules with set-up time included
- Parallel Metaheuristics
- Parallel Processing and Applied Mathematics
- Parallel Programming
- Scheduling flow shops using differential evolution algorithm
- Scheduling in flowshops to minimize total tardiness of jobs
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Some Computer Organizations and Their Effectiveness
- Tabu search for total tardiness minimization in flowshop scheduling problems
Cited in
(13)- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
- Flow shops with machine maintenance: ordered and proportionate cases
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
- Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
- Parallel hybrid heuristics for the permutation flow shop problem
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- A multi-agent based cooperative approach to scheduling and routing
- A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty
- A cooperative hyper-heuristic search framework
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- New hard benchmark for flowshop scheduling problems minimising makespan
- The distributed permutation flowshop scheduling problem
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)
