Part type selection problem in flexible manufacturing systems: Tabu search algorithms
From MaRDI portal
Publication:2367007
Cites work
- A loading and dispatching problem in a random flexible manufacturing system
- A tabu search experience in production scheduling
- Effects of loading and routeing decisions on performance of flexible manufacturing systems
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- Modelling and scheduling of a flexible manufacturing system
- Modelling and solving an FMS part selection problem
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu search for large scale timetabling problems
- Using tabu search techniques for graph coloring
Cited in
(2)
This page was built for publication: Part type selection problem in flexible manufacturing systems: Tabu search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367007)