This is a preview. Log in through your library . Abstract We consider preemptive scheduling on parallel machines where the number of available machines may be an arbitrary, possibly random, function ...
This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback