We thank Amir Leshem for plenty helpful discussions. Research supported in part by the Israel Science Foundation (ISF) through grant No. 1078/17.
In this paper we analyze the tractability of the classical classical NP-hard single machine scheduling problem with the objective of minimizing the total weighted number of tardy jobs, when a subset of its parameters is of a limited size. We focus o…
There aren't more papers