Genetic local search for multi-objective flowshop scheduling problems
From MaRDI portal
Publication:2566706
DOI10.1016/j.ejor.2004.07.017zbMath1077.90023OpenAlexW2043992751MaRDI QIDQ2566706
Vinicius Amaral Armentano, José Elias Claudio Arroyo
Publication date: 28 September 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.07.017
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
An optimization approach for ambulance location and the districting of the response segments on highways ⋮ Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem ⋮ A united search particle swarm optimization algorithm for multiobjective scheduling problem ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ Decentralized operation strategies for an integrated building energy system using a memetic algorithm ⋮ A hypercube queueing model embedded into a genetic algorithm for ambulance deployment on highways ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ Scheduling at coal handling facilities using simulated annealing ⋮ Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ Mathematical analysis and solutions for multi-objective line-cell conversion problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Multiple and bicriteria scheduling: A literature survey
- A fast tabu search algorithm for the permutation flow-shop problem
- A bicriteria two-machine permutation flowshop problem
- Tabu search for total tardiness minimization in flowshop scheduling problems
- An interactive procedure for bi-criteria production scheduling
- Heuristics for scheduling in flowshop with multiple objectives
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- A bicriteria approach to the two-machine flow shop scheduling problem
- A decomposition algorithm for the single machine total tardiness problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Benchmarks for basic scheduling problems
- Multicriteria scheduling problems: a survey
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- Efficiency of interactive multi-objective simulated annealing through a case study
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Bicriterion scheduling in the two-machine flowshop
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- A partial enumeration heuristic for multi-objective flowshop scheduling problems
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Local search heuristics for two-stage flow shop problems with secondary criterion
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- Genetic local search for multi-objective combinatorial optimization
