2004
DOI: 10.1016/s0377-2217(03)00232-7
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
24
0

Year Published

2006
2006
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 40 publications
(25 citation statements)
references
References 17 publications
1
24
0
Order By: Relevance
“…This property is also similar for the problems in Qi et al (1999) and Akturk et al (2004). Proof: The left inequality above is a feasibility condition for the problem.…”
Section: Property 33 (Average Job Time)mentioning
confidence: 66%
See 4 more Smart Citations
“…This property is also similar for the problems in Qi et al (1999) and Akturk et al (2004). Proof: The left inequality above is a feasibility condition for the problem.…”
Section: Property 33 (Average Job Time)mentioning
confidence: 66%
“…The total completion time problem with fixed processing times and unavailability constraints such that a machine can operate at most T40 hours between two PM visits was shown to be NP-hard by Qi et al (1999) and Akturk et al (2004). In this study, we have controllable processing times and employ a nonlinear PM index function for PM scheduling decisions, therefore we deal with a more difficult problem.…”
Section: Problem Definitionmentioning
confidence: 99%
See 3 more Smart Citations