Cooperative metaheuristics for the permutation flowshop scheduling problem

DOI10.1016/j.ejor.2007.11.049zbMath1160.90488OpenAlexW1982956761MaRDI QIDQ958077

Rubén Ruiz, Eva Vallada

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

zbMATH Keywords

schedulingmakespantotal tardinesspermutation flowshopcooperative metaheuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms ⋮ A scatter search algorithm for the distributed permutation flowshop scheduling problem ⋮ New hard benchmark for flowshop scheduling problems minimising makespan ⋮ A multi-agent based cooperative approach to scheduling and routing ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Parallel hybrid heuristics for the permutation flow shop problem ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ The distributed permutation flowshop scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• Tabu search for total tardiness minimization in flowshop scheduling problems
• 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
• Optimal two- and three-stage production schedules with setup times included
• Focused Scheduling in Proportionate Flowshops
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Scheduling in flowshops to minimize total tardiness of jobs
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• Parallel Processing and Applied Mathematics
• Parallel Metaheuristics
• Some Computer Organizations and Their Effectiveness
• Parallel Programming

This page was built for publication: Cooperative metaheuristics for the permutation flowshop scheduling problem