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 adjacent exchange of jobs 4 and 5 essentially is job 4 relocating after job 5, or 76 equivalently, job 5 relocating before job 4
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.