A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
From MaRDI portal
Publication:1027588
DOI10.1016/j.ejor.2008.08.023zbMath1163.90532MaRDI QIDQ1027588
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
local search; makespan; genetic algorithm; flowshop scheduling; hybrid genetic algorithm; total flowtime
90B40: Search theory
Related Items
Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem, A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty, An effective differential evolution algorithm for permutation flow shop 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, An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, A poly-hybrid PSO optimization method with intelligent parameter adjustment, Exact methods for the robotic cell problem, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival, Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, 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, Fast heuristics for minimizing the makespan in non-permutation flow shops, Local search methods for the flowshop scheduling problem with flowtime minimization, Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem, A Birnbaum-importance based genetic local search algorithm for component assignment problems, Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time, Multi-project scheduling problem under shared multi-skill resource constraints, A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production
Cites Work
- Unnamed Item
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Flowshop sequencing with mean flowtime objective
- A fast tabu search algorithm for the permutation flow-shop problem
- 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 genetic algorithm for flowshop sequencing
- 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 very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Optimal two- and three-stage production schedules with setup times included
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
