Approximation algorithms for scheduling C-benevolent jobs on weighted machines
Sign Up to like & getrecommendations! Published in 2020 at "IISE Transactions"
DOI: 10.1080/24725854.2019.1657606
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… read more here.
Keywords: algorithm; greedy algorithm; scheduling benevolent; greedy ... See more keywords