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 change of job 5’s waiting time is: w5 =r3 +w2 3 +p3−r5−w5 =p4 +w3−p4 =w3
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.