A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
From MaRDI portal
Publication:336357
DOI10.1016/j.cor.2013.01.005zbMath1348.90316OpenAlexW2135743864MaRDI QIDQ336357
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.005
heuristic optimizationdifferential evolution algorithmiterated greedy algorithmno-idle permutation flowshop scheduling problem
Related Items (18)
Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion ⋮ A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem ⋮ A systematic literature review on no-idle flow shop scheduling problem ⋮ A branch-and-bound approach to the no-idle flowshop scheduling problem ⋮ Improved bounded dynamic programming algorithm for solving the blocking flow shop problem ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ An improved binary differential evolution algorithm for optimizing PWM control laws of power inverters ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Uses Software
Cites Work
- Unnamed Item
- Flowshop/no-idle scheduling to minimize total elapsed time
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- On no-wait and no-idle flow shops with makespan criterion
- Some efficient heuristic methods for the flow shop sequencing problem
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Variable neighborhood search
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- A comprehensive review and evaluation of permutation flowshop heuristics
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- Benchmarks for basic scheduling problems
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- Flowshop/no-idle scheduling to minimise the mean flowtime
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Note: On the two-machine no-idle flowshop problem
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Flowshop-scheduling problems with makespan criterion: a review
This page was built for publication: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
