| Article ID: | iaor2005515 |
| Country: | Netherlands |
| Volume: | 8 |
| Issue: | 3 |
| Start Page Number: | 227 |
| End Page Number: | 240 |
| Publication Date: | Sep 2004 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Sarin Subhash C. |
We consider the problem of scheduling jobs on parallel, identical machines so as to minimize a primary and a secondary criterion. All the jobs are assumed to have identical processing times. Polynomial time algorithms, that generate optimal solutions, are presented for various combinations of primary and secondary criteria.