In this paper we consider a class of parallel machine scheduling problems and their associated set-partitioning formulations. We show that the tightness of the linear programming relaxation of these ...

This is a preview. Log in through your library . Abstract This paper considers the problem of scheduling n jobs, each having a processing time, a due date and a weight, on a single machine to minimize ...