An Improvement-Path Framework and an Exact Algorithm for Single-Machine Scheduling with Release Times
This paper proposes a novel improvement-path framework and an exact iterative repair algorithm that, by modeling machine idle time as negative waiting time to simplify the problem structure and characterizing queue discontinuity as the sole obstacle to improvement, guarantees finding a globally optimal schedule for the NP-hard single-machine scheduling problem with release times in finite time.