Online generalized assignment problem with historical information

Haodong Liu, Huili Zhang, Kelin Luo, Yao Xu, Yinfeng Xu, Weitian Tong

Abstract: Highlights•Study the online generalized assignment problem in the random order model.•Use historical information to boost the performance of online algorithms.•Design competitive algorithms and computationally efficient heuristics.•Evaluate the performance of the proposed algorithms via experiments.