ALGORITHMS FOR MINCLIQUE SCHEDULING PROBLEMS

We consider a family of well-known scheduling problems that reduce to the problem of finding a minimum weighted clique in a complete weighte d graph with negative weights and self-loops allowed. We present a uni form algorithmic approach to finding optimal as well as suboptimal sol utions for these problems. Also, we report results of computational te sts for suboptimal algorithms developed in the paper.