Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

0.00 Avg rating0 Votes
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: ,
Keywords: heuristics, internet
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.