Competitive algorithms for due date scheduling

DOI10.1007/s00453-009-9321-4zbMath1211.68516OpenAlexW2022243760MaRDI QIDQ633847

Ho-Leung Chan, Nikhil Bansal, Kirk R. Pruhs

Publication date: 30 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9321-4

zbMATH Keywords

schedulingcompetitive analysisonline algorithmsdue datessupply chain

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden

Cites Work

• Unnamed Item
• Online weighted flow time and deadline scheduling
• Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues
• Speed is as powerful as clairvoyance

This page was built for publication: Competitive algorithms for due date scheduling