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 ...
We study the problem of obtaining feasible preemptive schedules for independent jobs. It is assumed that each job has associated with it a release and due time. No job can begin before its release ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback