| Article ID: | iaor20043061 |
| Country: | China |
| Volume: | 18A |
| Issue: | 1 |
| Start Page Number: | 105 |
| End Page Number: | 114 |
| Publication Date: | Mar 2003 |
| Journal: | Applied Mathematics (A Journal of Chinese Universities) |
| Authors: | Tan Zhiyi, Yong He, Yang Qifan |
A survey of the progress of semi on-line algorithms on parallel machine scheduling problems is made. The application background, definition, classification and solutions of semi on-line scheduling problems are presented. The design and analysis of algorithms for the first class of semi on-line parallel machine scheduling problems are considered.