Online scheduling of unit jobs on three machines with rejection: a tight result
type: Item
instance of: scholarly article
title: Online scheduling of unit jobs on three machines with rejection: a tight result
zbMATH Open document ID: 1348.90255
author: Leah Epstein
author: Hanan Zebedat-Haider
published in: Information Processing Letters
publication date: 2016-01-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6526414
zbMATH Keywords: online algorithms
zbMATH Keywords: scheduling
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: j.ipl.2015.11.012
OpenAlex ID: W2195770176
cites work: Multiprocessor Scheduling with Rejection
cites work: Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
cites work: Scheduling with machine cost and rejection
cites work: Online scheduling with rejection and reordering: exact algorithms for unit size jobs
cites work: Online scheduling with rejection and withdrawal
cites work: Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
cites work: Rent or buy problems with a fixed time horizon
cites work: On-line uniform machine scheduling with rejection
cites work: Scheduling with deadlines and loss functions
cites work: Optimal semi-online algorithm for scheduling with rejection on two uniform machines
cites work: Semi-online scheduling on two identical machines with rejection
cites work: Preemptive multiprocessor scheduling with rejection
cites work: Semi-online scheduling with decreasing job sizes
DOI: 10.1016/J.IPL.2015.11.012
description: scientific article; zbMATH DE number 6526414