human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups authors who co-authored the same paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "On-line windows scheduling of temporary items"):
  Abstract: In this paper we study on-line windows scheduling (WS) of temporary items In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit Upon the arrival of an item with a window w, where w is a positive integer, the item has to be scheduled on a channel such that it will be broadcasted in the channel at least once every w time units until its departure With the on-line input of these temporary items, the problem is to minimize the maximum number of channels used over all time We give a 5-competitive on-line algorithm and show that there is a lower bound of 2–e for any e > 0 on the competitive ratio of any on-line algorithm.

Includes members:
  Member "Windows scheduling as a restricted version of bin packing":
    also connected through other hyperedges:
      (none)

Question: Please tell me which research area the co-authored paper (i.e., the source paper of the center hyperedge) belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science