A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time


This paper proposes an efficient exact algorithm for the general single-machine scheduling problem where machine idle time is permitted. The algorithm is an extension of the authors’ previous algorithm for the problem without machine idle time, which is based on the SSDP (Successive Sublimation Dynamic Programming) method. We first extend our previous… (More)
DOI: 10.1007/s10951-011-0242-0


10 Figures and Tables

Slides referencing similar topics