Sequencing a batching flexible cell to minimise set-up costs

摘要

In this paper, we consider the problem of scheduling parts' operations in flexible manufacturing cells. We consider the case in which the manufacturing cell has a single machine but can accommodate up to k parts at the same time. The processing of each part requires a sequence of different tools, and this implies a sequence of tool changes to be performed. Assuming constant set-up times, the objective is to minimise the total number of set-ups (tool switches), considering a material handling system able to remove a part from the manufacturing cell even if the other parts in the cell are not completed yet. Hence, the problem consists of partitioning the parts in k groups and sequencing them in each group. Such problem is NP-hard even for k = 3. In this work, we develop a heuristic algorithm for its solution and test its performance on randomly generated instances.