A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
From MaRDI portal
Publication:632658
DOI10.1016/J.COR.2010.10.008zbMATH Open1208.90059OpenAlexW2002357639MaRDI QIDQ632658FDOQ632658
Authors: 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
Recommendations
- A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
- The hybrid flow shop scheduling problem
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
- Bounding strategies for the hybrid flow shop scheduling problem
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
- A systematic review of multi-objective hybrid flow shop scheduling
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- The Complexity of Flowshop and Jobshop Scheduling
- Title not available (Why is that?)
- Stochastic local search algorithms for multiobjective combinatorial optimization: methods and analysis
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Stochastic local search. Foundations and applications.
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- 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
- Exploratory analysis of stochastic local search algorithms in biobjective optimization
- Bicriteria Transportation Problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- 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
- On local optima in multiobjective combinatorial optimization problems
- Title not available (Why is that?)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Genetic local search for multi-objective flowshop scheduling problems
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- A partial enumeration heuristic for multi-objective flowshop scheduling problems
Cited In (26)
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
- Automatic algorithm design for hybrid flowshop scheduling problems
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments
- Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm
- Many-objective Pareto local search
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- An exact parallel method for a bi-objective permutation flowshop problem
- A hybrid evolutionary algorithm for bi-objective job shop scheduling problems
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- Anytime Pareto local search
- A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling
- Improving the anytime behavior of two-phase local search
- Clarifying cutting and sewing processes with due windows using an effective ant colony optimization
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
- 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
- Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
- Region based memetic algorithm for real-parameter optimisation
- Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
- Local search methods for the flowshop scheduling problem with flowtime minimization
- P2P B&B and GA for the Flow-Shop Scheduling Problem
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
Uses Software
This page was built for publication: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632658)
