A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
From MaRDI portal
Publication:632658
DOI10.1016/j.cor.2010.10.008zbMath1208.90059OpenAlexW2002357639MaRDI QIDQ632658
Jérémie Dubois-Lacoste, Manuel López-Ibáñez, Thomas Stützle
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/138811/1/journal.pdf
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items
Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm, A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments, Anytime Pareto local search, Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows, Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling, An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem, Many-objective Pareto local search, Local search methods for the flowshop scheduling problem with flowtime minimization, An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time, Improving the anytime behavior of two-phase local search, Region based memetic algorithm for real-parameter optimisation, Clarifying cutting and sewing processes with due windows using an effective ant colony optimization, Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm, Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms, Automatic algorithm design for hybrid flowshop scheduling problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- On local optima in multiobjective combinatorial optimization problems
- Genetic local search for multi-objective flowshop scheduling problems
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization
- Minimizing Total Tardiness on One Machine is NP-Hard
- Bicriteria Transportation Problem
- The Complexity of Flowshop and Jobshop Scheduling
- A partial enumeration heuristic for multi-objective flowshop scheduling problems
