| Article ID: | iaor20063366 |
| Country: | China |
| Volume: | 23 |
| Issue: | 4 |
| Start Page Number: | 93 |
| End Page Number: | 96 |
| Publication Date: | Apr 2005 |
| Journal: | Systems Engineering |
| Authors: | Xu Chuanrong, Xie Zheng |
The single machine scheduling problem is considered with tree-structured and linear processing time ordering to minimize the total weighted completion time. In this case, jobs in the maximal family tree should be processed prior to other jobs in family tree and the optimal schedule is obtained if their jobs aren't preempted by the other jobs.