Scheduling flexible manufacturing cells using Tabu Search
From MaRDI portal
Publication:3055220
DOI10.1080/00207540802400628zbMath1198.90206OpenAlexW2021340971MaRDI QIDQ3055220
R. A. Jun. Pitts, José A. Ventura
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540802400628
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems ⋮ Pharmacy duty scheduling problem ⋮ Memory and Learning in Metaheuristics
Uses Software
Cites Work
- Unnamed Item
- New trends in machine scheduling
- A global MILP model for FMS scheduling
- Loading and scheduling of a flexible assembly system by mixed integer programming.
- A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment
- The classification of FMS scheduling problems
- A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
- Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment
This page was built for publication: Scheduling flexible manufacturing cells using Tabu Search