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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback