This is a preview. Log in through your library . Abstract We present a polynomial approximation scheme for a two-machine flow shop scheduling problem with the additional constraint that each job has a ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results