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

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

0.00 Avg rating0 Votes
Article ID: iaor2004143
Country: United States
Volume: 50
Issue: 1
Start Page Number: 15
End Page Number: 30
Publication Date: Feb 2003
Journal: Naval Research Logistics
Authors: , ,
Keywords: programming: integer, scheduling
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. I 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 computer numerical control 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 mode 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 shortest processing time (SPT) rule remains good when the tool change time is small but deteriorates as this time increased and further that the proposed algorithms promise significant improvement over the SPT rule.

Reviews

Required fields are marked *. Your email address will not be published.