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.
Because of preconditions w5 + min(0,w 4)−p4 <−fI, we have (w4 +w5 +fI)<p 4, so: ∆wpositive =p4 +p5−2(w4 +w5 +fI) >p 4 +p5−2p4 =p5−p4
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.