Semi-online scheduling with machine cost

Abstract

For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. Recently Imreh and Nogaproposed to add the concept of machine cost to scheduling problems and considered the so-calledList Model problem. An online algorithm with a competitive ratio 1.618 was given while the lower bound is 4/3. In this… (More)
DOI: 10.1007/BF02960768

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics