| Article ID: | iaor2006807 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 6 |
| Start Page Number: | 587 |
| End Page Number: | 596 |
| Publication Date: | Nov 2005 |
| Journal: | Operations Research Letters |
| Authors: | Johannes Berit |
We present various complexity results for scheduling unit-time jobs subject to OR-precedence constraints. We prove that minimizing the total weighted completion time is strongly NP-hard, even on a single machine. In contrast, we give a polynomial-time algorithm for minimizing the makespan and the total completion time on identical parallel machines.