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.005zbMATH Open1348.90316OpenAlexW2135743864MaRDI QIDQ336357FDOQ336357
Authors: M. Fatih Tasgetiren, Quanke Pan, P. N. Suganthan, Ozge Buyukdagli 
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
Recommendations
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
differential evolution algorithmheuristic optimizationiterated greedy algorithmno-idle permutation flowshop scheduling problem
Cites Work
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Variable neighborhood search
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- Flowshop-scheduling problems with makespan criterion: a review
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- 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
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- 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
- Title not available (Why is that?)
- Flowshop/no-idle scheduling to minimize total elapsed time
- On no-wait and no-idle flow shops with makespan criterion
Cited In (20)
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- Total completion time with makespan constraint in no-wait flowshops with setup times
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- An improved binary differential evolution algorithm for optimizing PWM control laws of power inverters
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
- A branch-and-bound approach to the no-idle flowshop scheduling problem
- A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- A systematic literature review on no-idle flow shop scheduling problem
Uses Software
This page was built for publication: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336357)
