Minimization of number of tool switching instants in automated manufacturing systems

Gökgür, Burak and Ozpeynirci, Selin (2022) Minimization of number of tool switching instants in automated manufacturing systems. Gazi University Journal of Science, 35 (1). pp. 113-130. ISSN 2147-1762

This is the latest version of this item.

Full text not available from this repository. (Request a copy)


This study addresses the problem of minimizing tool switching instants in automated manufacturing systems. There exist a single machine and a group of jobs to be processed on it. Each job requires a set of tools, and due to limited tool magazine capacity, and because it is not possible to load all available tools on the machine, tools must be switched. The ultimate goal, in this framework, is to minimize the total number of tool switching instants. We provide a mathematical programming model and two constraint programming models for the problem. Because the problem is proven to be NP-hard, we develop two heuristic approaches, and compare their performance with methods described in the literature. Our analysis indicates that our constraint programming models perform relatively well in solution quality and execution time in small-sized problem instances. The performance of our greedy approach shows potential, reaching the optimal solution in 82.5% of instances. We also statistically demonstrate that the search algorithm enhances the quality of the solution obtained by the greedy heuristic, particularly in large sets. Hence, the solution approach, i.e., the greedy heuristic and the search algorithm proposed in this study is able to quickly reach near-optimal solutions, showing that the method is appropriate for manufacturing settings requiring sudden adjustments.
Item Type: Article
Uncontrolled Keywords: Constraint programming; Heuristic algorithm; Job grouping problem; Mathematical model; Tool switching instants
Divisions: Sabancı Business School
Depositing User: Burak Gökgür
Date Deposited: 23 Aug 2022 23:24
Last Modified: 23 Aug 2022 23:24

Available Versions of this Item

Actions (login required)

View Item
View Item