scientific article; zbMATH DE number 1875417

zbMath1159.90395MaRDI QIDQ4796176

Alexander V. Kononov, Evripidis Bampis, Eric Angel

Publication date: 2 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610194

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (12)

Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Approximating Scheduling Machines with Capacity Constraints ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Bicriteria approximation algorithms for scheduling problems with communications delays ⋮ A survey on offline scheduling with rejection ⋮ Penalty cost constrained identical parallel machine scheduling problem ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs ⋮ Analyzing scheduling with transient failures ⋮ Approximation schemes for scheduling and covering on unrelated machines ⋮ One-exact approximate Pareto sets ⋮ Truthful mechanisms for two-range-values variant of unrelated scheduling

This page was built for publication: