Develops an improvement-path framework that yields a finite-termination exact iterative repair algorithm for minimizing total waiting time in single-machine scheduling with release times.
The impact of job 3’ waiting time change on the total waiting time is: ∆ 3 = ∆w+ 4 =p3 +p4−w4
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GM 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Improvement-Path Framework and an Exact Algorithm for Single-Machine Scheduling with Release Times
Develops an improvement-path framework that yields a finite-termination exact iterative repair algorithm for minimizing total waiting time in single-machine scheduling with release times.