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 describes a nurse scheduling system, the heart of which poses the scheduling decision as a large multiple-choice programming ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results