A note of using effective immune based approach for the flow shop scheduling with buffers
From MaRDI portal
(Redirected from Publication:1045843)
Recommendations
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Flow-shop problems with intermediate buffers
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2
- The permutation flow shop with buffers: A tabu search approach
Cites work
- A genetic algorithm for flowshop sequencing
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Flow-shop problems with intermediate buffers
- Flowshop sequencing problems with limited buffer storage
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 702365 (Why is no real title available?)
- Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- The permutation flow shop with buffers: A tabu search approach
Cited in
(2)
This page was built for publication: A note of using effective immune based approach for the flow shop scheduling with buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045843)