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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results