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 ...
This is a preview. Log in through your library . Abstract This paper considers the problem of scheduling n jobs, each having a processing time, a due date and a weight, on a single machine to minimize ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback