#### Filter Results:

#### Publication Year

2006

2008

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider the non-preemptive 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 P 2 | p j = p, r j | U j. The problem is known to be polynomially solvable in… (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 | <i>p<sub>j</sub></i> = <i>p</i>,<i>r<sub>j</sub></i>… (More)

- ‹
- 1
- ›