Publication:4537758
From MaRDI portal
zbMath1010.90025MaRDI QIDQ4537758
Publication date: 20 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810396
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, How useful are preemptive schedules?, Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times, Designing PTASs for MIN-SUM scheduling problems, Faster Algorithms for Semi-Matching Problems, Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines