Article detail · 2003 · article
Scheduling with tool changes to minimize total completion time A studyof heuristics and their performance
Data source split
- YÖKSİSYÖKSİS article record
- YÖKSİS venueNAVAL RESEARCH LOGISTICS
- Catalog match (ISSN)Naval Research Logistics
- OpenAlexOpenAlex enrichment (abstract, citations, topics)
- Semantic Scholarcitation count (not merged with OpenAlex)
Abstract
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
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
54citationsOpenAlex · cited_by_count (cache / database)
7 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).
- 2004 Scheduling with tool changes to minimize total completion time Basicresults and SPT performanceCitations 50 · OpenAlex
- 2003 Scheduling with tool changes to minimize total completion time: Basic results and SPT performanceCitations 50 · OpenAlex
- 2005 Scheduling with tool changes to minimize total completion time under controllable machining conditionsCitations 30 · OpenAlex
- 2008 The tool transporter movements problem in flexible manufacturing systemsCitations 12 · OpenAlex
- 2008 The tool transporter movements problem in flexible manufacturing systemsCitations 12 · OpenAlex
- 2006 Minimizing total flow time on a single flexible machineCitations 8 · OpenAlex
- 2024 Unrelated parallel machine scheduling under machine availability and eligibility constraints to minimize the makespan of non-resumable jobsCitations 5 · OpenAlex