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

Simple item page
dc.citation.epage30en_US
dc.citation.issueNumber1en_US
dc.citation.spage15en_US
dc.citation.volumeNumber50en_US
dc.contributor.authorAktürk, M. S.en_US
dc.contributor.authorGhosh, J. B.en_US
dc.contributor.authorGüneş, E. D.en_US
dc.date.accessioned2018-04-12T13:44:34Z
dc.date.available2018-04-12T13:44:34Z
dc.date.issued2003en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThe 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.en_US
dc.identifier.doi10.1002/nav.10045en_US
dc.identifier.eissn1520-6750
dc.identifier.issn0894-069X
dc.identifier.urihttp://hdl.handle.net/11693/38104
dc.language.isoEnglishen_US
dc.publisherJohn Wiley & Sons, Inc.en_US
dc.relation.isversionofhttp://dx.doi.org/10.1002/nav.10045en_US
dc.source.titleNaval Research Logisticsen_US
dc.subjectAlgorithmsen_US
dc.subjectComputer control systemsen_US
dc.subjectComputer simulationen_US
dc.subjectHeuristic methodsen_US
dc.subjectLinear programmingen_US
dc.subjectNumerical control systemsen_US
dc.subjectPerformanceen_US
dc.subjectProcess engineeringen_US
dc.subjectSchedulingen_US
dc.subjectToolsen_US
dc.subjectTool allocationen_US
dc.subjectFactory automationen_US
dc.titleScheduling with tool changes to minimize total completion time: a study of heuristics and their performanceen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Scheduling with tool changes to minimize total completion time A study of heuristics and their performance.pdf
Size:
100.64 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering