P. Cai et al., EFFICIENT ALGORITHMS FOR A SCHEDULING PROBLEM AND ITS APPLICATIONS TOILLICIT DRUG MARKET CRACKDOWNS, Journal of combinatorial optimization, 1(4), 1998, pp. 367-376
We give polynomial time algorithms for a job scheduling problem. By du
ality we transform a special case of the drug market crackdown schedul
ing problem to the above job scheduling problem and thus derive polyno
mial time algorithms to the second problem. Finally, using the algorit
hm for the special case, we develop a quasipolynomial time approximati
on algorithm for the general case of the drug market crackdown schedul
ing problem with monomial cost functions.