scientific article; zbMATH DE number 2080224

zbMATH Open1044.68940MaRDI QIDQ4472467FDOQ4472467

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

Publication date: 4 August 2004

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (5)

• Min Sum Edge Coloring in Multigraphs Via Configuration LP
• Designing PTASs for MIN-SUM scheduling problems
• Scheduling to minimize makespan about increase of processing times
• Title not available (Why is that?)
• Scheduling to minimize the total compression and late costs

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A polynomial algorithm for some preemptive multiprocessor task scheduling problems 👍 👎
• Minimizing average completion time in the presence of release dates 👍 👎
• Title not available (Why is that?) 👍 👎

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)