We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard. We propose a heuristic and a lower bound based on job splitting and the Viswanathkumar and Srinivasan procedure. The test on more than 2000 instances shows that...

This paper investigates the existence of absolute optimal solutions for a partition P in continuous and quasiconcave games. We show that the P-consistency property introduced in the paper, together with the quasiconcavity and continuity of payoffs, permits the existence of P-absolute optimal...