A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times
From MaRDI portal
Publication:709158
DOI10.1016/j.cor.2010.06.006zbMath1231.90179OpenAlexW2041714725MaRDI QIDQ709158
Radhouan Bouabda, Mansour Eddaly, Abdelwaheb Rebaï, Bassem Jarboui
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.06.006
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ A comprehensive review of flowshop group scheduling literature ⋮ Heuristic algorithm for univariate stratification problem ⋮ A branch and bound algorithm for dynamic resource allocation in population disease management
Cites Work
- Unnamed Item
- Unnamed Item
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Guest editorial: Hybrid metaheuristics
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
- Hybridizing exact methods and metaheuristics: a taxonomy
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- A survey of scheduling problems with setup times or costs
- Forming part families by using genetic algorithm and designing machine cells under demand changes
- A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times
