Title

Optimal Discounts for the Online Assignment Problem

Document Type

Article

Publication Date

1-2013

Publication Title

Operations Research Letters

Department

Mathematics and Computer Science

Abstract

We prove that, for two simple functions drltdrlt, solving the online assignment problem with crl?drltcrl?drlt as the contribution for assigning resource rr to task ll at time tt gives the optimal solution to the corresponding offline assignment problem (provided the optimal offline solution is unique). We call such functions drltdrltoptimal discount functions.

Volume

41

Issue

1

pp.

112-115

ISSN

0167-6377

Link to Full Text

Share

COinS