We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than...

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 pure strategy, dominant strategy, and mixed strategy Nash equilibria in discontinuous games. We introduce a new notion of weak continuity, called weak transfer quasi-continuity, which is weaker than most known weak notions of continuity, including...