Competitive Algorithms for Due Date Scheduling

DOI10.1007/978-3-540-73420-8_5MaRDI QIDQ5428795zbMATH OpenOpenAlexFDO

Authors N. Bansal, Ho-Leung Chan, Kirk 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)

Recommendations

• Competitive algorithms for due date scheduling
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling
• Energy-Efficient Due Date Scheduling
• Online scheduling with immediate and reliable lead-time quotation
• Competitive analysis for make-to-order scheduling with reliable lead time quotation

Cited in

(7)

• Online MTO lead-time scheduling: a probabilistic approach
• Online scheduling with immediate and reliable lead-time quotation
• Optimally Handling Commitment Issues in Online Throughput Maximization
• A general framework for handling commitment in online throughput maximization
• Competitive algorithms for due date scheduling
• Maximizing throughput for parallel jobs with speed-up curves
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428795)