Competitive strategies for an online generalized assignment problem with a service consecution constraint

► We study a variant of the online generalized assignment problem with a service consecution constraint. ► We investigate both deterministic and randomized online strategies for this problem. ► The deterministic strategy proposed in our paper is optimal, in terms of the worst case competitive ratio. ► Computational tests show that our proposed strategies have very good practical performance.