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 ...
https://doi.org/10.2307/2584360 • https://www.jstor.org/stable/2584360 Copy URL In this paper we are concerned with the problem of sequencing a given set of jobs ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback