| Article ID: | iaor20052558 |
| Country: | France |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 37 |
| End Page Number: | 51 |
| Publication Date: | Jan 2002 |
| Journal: | RAIRO Operations Research |
| Authors: | Blazewicz Jacek, Drozdowski Maciej, Dell'Olmo Paolo |
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution times and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.