Competitive Algorithms for Due Date Scheduling

DOI10.1007/978-3-540-73420-8_5zbMath1171.90390OpenAlexW1605144974MaRDI QIDQ5428795

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

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_5

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ A general framework for handling commitment in online throughput maximization

This page was built for publication: Competitive Algorithms for Due Date Scheduling