An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers

DOI10.1080/00207540701528750zbMath1152.90461OpenAlexW2116853369MaRDI QIDQ3596695

Ling Wang, Bin Qian, Xiong Wang, De-Xian Huang

Publication date: 29 January 2009

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701528750

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time

Cites Work

• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• Scheduling flow shops using differential evolution algorithm
• Some efficient heuristic methods for the flow shop sequencing problem
• A differential evolution approach for the common due date early/tardy job scheduling problem
• Modified simulated annealing algorithms for the flow shop sequencing problem
• A fast tabu search algorithm for the permutation flow-shop problem
• Landscapes, operators and heuristic search
• A genetic algorithm for flowshop sequencing
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Flow-shop problems with intermediate buffers
• The permutation flow shop with buffers: A tabu search approach
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• Benchmarks for basic scheduling problems
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Some aspects of scatter search in the flow-shop problem
• Flowshop sequencing problems with limited buffer storage
• Flowshop scheduling with limited temporary storage
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers