Part type selection problem in flexible manufacturing systems: tabu search algorithms

Production planning in flexible manufacturing systems is concerned with the organization of production in order to satisfy a given master production schedule. The planning problem typically gives rise to several hierarchical subproblems which are then solved sequentially or simultaneously. In this paper, we address one of the subproblems: the part type selection problem. The problem is to determine a subset of part types having production requirements for immediate and simultaneous processing over the upcoming period of the planning horizon, subject to the tool magazine and processing time limitation. Several versions of tabu search (TS) algorithm are proposed for solving the problem. A systematic computational test is conducted to test the performance of the TS algorithms. The best TS algorithm developed is compared to a simulated annealing algorithm.