A note of using effective immune based approach for the flow shop scheduling with buffers

DOI10.1016/j.amc.2009.07.033zbMath1177.90162OpenAlexW2055274492MaRDI QIDQ1045843

Cheng-Dar Liou, Peng-Sheng You, Yi-Chieh Hsieh

Publication date: 16 December 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.07.033

zbMATH Keywords

flow shopbufferimmune algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine

Uses Software

• OR-Library
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• A genetic algorithm for flowshop sequencing
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
• Flow-shop problems with intermediate buffers
• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• The permutation flow shop with buffers: A tabu search approach
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Flowshop sequencing problems with limited buffer storage