A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
From MaRDI portal
Publication:1027588
DOI10.1016/J.EJOR.2008.08.023zbMATH Open1163.90532OpenAlexW2002147970MaRDI QIDQ1027588FDOQ1027588
Authors: Ya-Tai Lin, Lin Yu Tseng 
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.023
Recommendations
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- The Complexity of Flowshop and Jobshop Scheduling
- A genetic algorithm for flowshop sequencing
- Title not available (Why is that?)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Some efficient heuristic methods for the flow shop sequencing problem
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- An Evaluation of Flow Shop Sequencing Heuristics
- Flowshop sequencing with mean flowtime objective
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
Cited In (25)
- A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production
- A local search method for permutation flow shop scheduling
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Exact methods for the robotic cell problem
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- A discrete inter-species cuckoo search for flowshop scheduling problems
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
- A poly-hybrid PSO optimization method with intelligent parameter adjustment
- Multi-project scheduling problem under shared multi-skill resource constraints
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
- Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- An efficient local search for minimizing completion time variance in permutation flow shops
- A Birnbaum-importance based genetic local search algorithm for component assignment problems
This page was built for publication: A hybrid genetic local search algorithm 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 Q1027588)
