Equivalence of two linear programming relaxations for broadcast scheduling

Equivalence of two linear programming relaxations for broadcast scheduling

0.00 Avg rating—0 Votes
Article ID: iaor20051063
Country: Netherlands
Volume: 32
Issue: 5
Start Page Number: 473
End Page Number: 478
Publication Date: Sep 2004
Journal: Operations Research Letters
Authors: ,
Keywords: programming: linear
Abstract:

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.

Reviews

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