Part type selection problem in flexible manufacturing systems: Tabu search algorithms
From MaRDI portal
Publication:2367007
DOI10.1007/BF02023078zbMath0775.90224OpenAlexW2084908039MaRDI QIDQ2367007
Bharatendu Srivestava, Wun-Hwa Chen
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02023078
Production models (90B30) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Metaheuristics: A bibliography ⋮ External partner selection using tabu search heuristics in distributed manufacturing
Uses Software
Cites Work
- Unnamed Item
- Using tabu search techniques for graph coloring
- Tabu search for large scale timetabling problems
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Modelling and scheduling of a flexible manufacturing system
- A tabu search experience in production scheduling
- Effects of loading and routeing decisions on performance of flexible manufacturing systems
- Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
- A loading and dispatching problem in a random flexible manufacturing system
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- 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
- Modelling and solving an FMS part selection problem
- Tabu Search Applied to the Quadratic Assignment Problem
This page was built for publication: Part type selection problem in flexible manufacturing systems: Tabu search algorithms