Article ID: | iaor2003189 |
Country: | United Kingdom |
Volume: | 29 |
Issue: | 8 |
Start Page Number: | 971 |
End Page Number: | 994 |
Publication Date: | Jul 2002 |
Journal: | Computers and Operations Research |
Authors: | Allahverdi Ali, Al-Anzi Fawaz S. |
Keywords: | heuristics, internet |
The multimedia data objects scheduling problem for WWW applications is modeled using the two-machine flowshop problem of minimizing maximum lateness with separate setup times. We establish three dominance relations, and propose four heuristics. Also, we conduct computational experiments to compare the performance of the proposed heuristics and that of existing ones in the literature. The results of the computational experiments show that the proposed heuristics are quite efficient.