scientific article; zbMATH DE number 2080224

MaRDI QIDQ4472467zbMATH OpenFDO

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

Publication date 4 August 2004

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1839475
• scientific article; zbMATH DE number 1754641
• 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)

• scientific article; zbMATH DE number 1754641 (Why is no real title available?)
• Scheduling to minimize makespan about increase of processing times
• Scheduling to minimize the total compression and late costs
• Min Sum Edge Coloring in Multigraphs Via Configuration LP
• Designing PTASs for MIN-SUM scheduling problems

This page was built for publication:

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