Approximation algorithms for scheduling C-benevolent jobs on weighted machines. (2nd April 2020)

• Record Type: Journal Article
• Authors: Yu, Ge; Jacobson, Sheldon H.
• Is Part Of: IISE transactions. Volume 52:Number 4(2020)
• Page Start: 432
• Page End: 443
• Publication Date: 2020-04-02
• Subjects: Online interval scheduling -- C-benevolent jobs -- approximation algorithm -- weighted machines; Industrial engineering -- Periodicals; Systems engineering -- Periodicals; Industrial engineering; Systems engineering; Electronic journals; Periodicals; 670.285
• DOI: 10.1080/24725854.2019.1657606
• Languages: English
• ISSNs: 2472-5854

Abstract

Abstract: This article considers a new variation of the online interval scheduling problem, which consists of scheduling C-benevolent jobs on multiple heterogeneous machines with different positive weights. The reward for completing a job assigned to a machine is given by the product of the job value and the machine weight. The objective of this scheduling problem is to maximize the total reward for completed jobs. Two classes of approximation algorithms are analyzed, Cooperative Greedy algorithms and Prioritized Greedy algorithms, with competitive ratios provided. We show that when the weight ratios between machines are small, the Cooperative Greedy algorithm outperforms the Prioritized Greedy algorithm. As the weight ratios increase, the Prioritized Greedy algorithm outperforms the Cooperative Greedy algorithm. Moreover, as the weight ratios approach infinity, the competitive ratio of the Prioritized Greedy algorithm approaches four. We also provide a lower bound of 3/2 and 9/7 for the competitive ratio of any deterministic algorithm for scheduling C-benevolent jobs on two and three machines with arbitrary weights, respectively.