Learn More
We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature, this problem is denoted as <i>P</i>2 &verbar; <i>p<sub>j</sub></i> &equals; <i>p</i>,<i>r<sub>j</sub></i>(More)
  • 1