scientific article; zbMATH DE number 1757970
From MaRDI portal
Publication:4537758
zbMath1010.90025MaRDI QIDQ4537758
Publication date: 20 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810396
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times ⋮ Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines ⋮ How useful are preemptive schedules? ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ Faster Algorithms for Semi-Matching Problems ⋮ Scheduling divisible loads with time and cost constraints
This page was built for publication:
