Competitive algorithms for due date scheduling
type: Item
instance of: scholarly article
title: Competitive algorithms for due date scheduling
zbMATH Open document ID: 1211.68516
author: N. Bansal
author: Ho-Leung Chan
author: Kirk Pruhs
published in: Algorithmica
publication date: 2011-03-30T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5871672
zbMATH Keywords: online algorithms
zbMATH Keywords: scheduling
zbMATH Keywords: competitive analysis
zbMATH Keywords: due dates
zbMATH Keywords: supply chain
MaRDI profile type: Publication
full work available at URL: s00453-009-9321-4
OpenAlex ID: W2022243760
cites work: Online weighted flow time and deadline scheduling
cites work: Speed is as powerful as clairvoyance
cites work: Q3374086
cites work: Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues
DOI: 10.1007/S00453-009-9321-4
description: scientific article; zbMATH DE number 5871672