Approximation algorithms for average stretch scheduling

DOI10.1023/B:JOSH.0000019681.52701.8BMaRDI QIDQ2464419zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 20 December 2007

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:josh.0000019681.52701.8b

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2119737
• Online Scheduling to Minimize Average Stretch
• Average stretch without migration
• scientific article; zbMATH DE number 1445347
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

Cited in

(14)

• The Complexity of Scheduling for p-Norms of Flow and Stretch
• Scheduling algorithms for procrastinators
• scientific article; zbMATH DE number 1445347 (Why is no real title available?)
• From preemptive to non-preemptive scheduling using rejections
• Minimizing the stretch when scheduling flows of divisible requests
• scientific article; zbMATH DE number 1688388 (Why is no real title available?)
• Average stretch without migration
• Improved lower bounds for online scheduling to minimize total stretch
• Online scheduling with general cost functions
• Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
• A PTAS for minimizing weighted flow time on a single machine
• scientific article; zbMATH DE number 2119737 (Why is no real title available?)
• Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
• Online Scheduling to Minimize Average Stretch

This page was built for publication: Approximation algorithms for average stretch scheduling

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