Extremal behavior of the Greedy algorithm for a triangle scheduling problem

We study the mixed-criticality scheduling problem, where the goal is to schedule jobs with different criticality levels on a single machine. As shown by Dürr et al. (2018), the problem can be treated as a specific 1-dimensional triangle scheduling problem. In that paper a new Greedy algorithm was de...

Full description

Bibliographic Details

Published in:	Computers & operations research Vol. 169; p. 106718
Main Authors:	Balogh, János, Békési, József, Büki, Nóra, Dósa, György, Tuza, Zsolt
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.09.2024
Subjects:	Algorithm analysis Mixed-criticality scheduling Triangle scheduling Mixed-criticality scheduling Algorithm analysis Triangle scheduling
ISSN:	0305-0548, 1873-765X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!