Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
type: Item
instance of: scholarly article
title: Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
zbMATH Open document ID: 1208.90068
author: Sven O. Krumke
author: Alfred Taudes
author: Stephan Westphal
published in: Computers \& Operations Research
publication date: 2011-03-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 5870565
zbMATH Keywords: revenue management
zbMATH Keywords: scheduling
zbMATH Keywords: on-line algorithms
zbMATH Keywords: competitiveness
MaRDI profile type: Publication
full work available at URL: j.cor.2010.10.012
OpenAlex ID: W2124168851
cites work: Q4223058
cites work: On-line scheduling to maximize task completions.
cites work: Online Scheduling with Hard Deadlines
cites work: Online Job Admission
cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
cites work: Revenue management: Research overview and prospects
cites work: Q3128890
cites work: Online Scheduling of Equal-Length Jobs on Parallel Machines
cites work: Automata, Languages and Programming
DOI: 10.1016/J.COR.2010.10.012
description: scientific article; zbMATH DE number 5870565