| Article ID: | iaor2006466 |
| Country: | Japan |
| Volume: | 48 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 8 |
| Publication Date: | Mar 2005 |
| Journal: | Journal of the Operations Research Society of Japan |
| Authors: | Hwang Hark-Chin, Chang Soo Young, Park Jongho |
| Keywords: | computational analysis, optimization |
We consider the semi-on-line parallel machines scheduling problem with the known total and the largest processing times of all jobs. We develop an approximation algorithm for the problem and prove that the competitive ratio of the algorithm is more than