Dynamic scheduling for switched processing systems with substantial service-mode switching times
For the canonical models concerning the switched processing systems (SPS), the authors propose a new scheduling strategy, called ``dynamic scheduling'', including substantial service-mode switching times. In addition, an extended scheduling strategy -- practical dynamic cone policy -- is also developed for practical purposes. Moreover, a simulation study is performed in order to show that this approach outperforms another throughput-maximizing policy (i.e. BatchAdapt).
scientific article; zbMATH DE number 5534451