A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem

DOI10.1016/J.COR.2013.01.005MaRDI QIDQ336357zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

differential evolution algorithmheuristic optimizationiterated greedy algorithmno-idle permutation flowshop scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 782644 (Why is no real title available?)
• A comprehensive review and evaluation of permutation flowshop heuristics
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
• Benchmarks for basic scheduling problems
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Flowshop-scheduling problems with makespan criterion: a review
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Flowshop/no-idle scheduling to minimise the mean flowtime
• Flowshop/no-idle scheduling to minimize total elapsed time
• Note: On the two-machine no-idle flowshop problem
• On no-wait and no-idle flow shops with makespan criterion
• Some efficient heuristic methods for the flow shop sequencing problem
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• Variable neighborhood search

Cited in

(20)

• A systematic literature review on no-idle flow shop scheduling problem
• 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
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
• Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
• 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 novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization
• A branch-and-bound approach to the no-idle flowshop scheduling problem
• 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

Describes a project that uses

Uses Software

• Ruben Ruiz benchmark suite

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)