Scheduling with tool changes to minimize total completion time: basic results and SPT performance
Date
2004-09-16Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Electronic ISSN
1872-6860
Publisher
Elsevier
Volume
157
Issue
3
Pages
784 - 790
Language
English
Type
ArticleItem Usage Stats
167
views
views
168
downloads
downloads
Abstract
We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total
completion time. We briefly describe the problem and discuss its properties, complexity and solution. Mainly, however,
we focus on the performance of the SPT list-scheduling heuristic. We provide theoretical worst-case bounds on SPT
performance and also demonstrate its empirical behavior.