Scheduling to minimize the average completion time of dedicated tasks

DOI10.1007/3-540-44450-5_37MaRDI QIDQ4472467zbMATH OpenFDO

Authors Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1974/19740454.htm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On minimizing average weighted completion time: A PTAS for scheduling general multiprocessor tasks
• On minimizing average weighted completion time of multiprocessor tasks with release dates
• A polynomial algorithm for some preemptive multiprocessor task scheduling problems
• Minimizing average completion time in the presence of release dates
• scientific article; zbMATH DE number 2185607

Cited in

(5)

• Designing PTASs for MIN-SUM scheduling problems
• Scheduling to minimize makespan about increase of processing times
• Min Sum Edge Coloring in Multigraphs Via Configuration LP
• Scheduling to minimize the total compression and late costs
• On minimizing average weighted completion time of multiprocessor tasks with release dates

This page was built for publication: Scheduling to minimize the average completion time of dedicated tasks

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