## 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.

Original language | English (US) |
---|---|

Pages (from-to) | 432-443 |

Number of pages | 12 |

Journal | IISE Transactions |

Volume | 52 |

Issue number | 4 |

DOIs | |

State | Published - Apr 2 2020 |

## Keywords

- C-benevolent jobs
- Online interval scheduling
- approximation algorithm
- weighted machines

## ASJC Scopus subject areas

- Industrial and Manufacturing Engineering