Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance

✍ Scribed by M. Selim Akturk; Jay B. Ghosh; Evrim D. Gunes

• Publisher: John Wiley and Sons
• Year: 2003
• Tongue: English
• Weight: 114 KB
• Volume: 50
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.10045

✦ Synopsis

Abstract

The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003