scientific article; zbMATH DE number 1754639
From MaRDI portal
Publication:4535067
zbMath0986.68503MaRDI QIDQ4535067
Sanjeev Khanna, Chandra Chekuri
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760848
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
schedulingweighted completion timeuniformly related machinespolynomial time approximation schemeaverage completion time
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (12)
Scheduling Bidirectional Traffic on a Path ⋮ Online Appointment Scheduling in the Random Order Model ⋮ Optimal restricted due date assignment in scheduling ⋮ The efficiency-fairness balance of round robin scheduling ⋮ Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Approximation algorithms for scheduling problems with a modified total weighted tardiness objective ⋮ Approximability of average completion time scheduling on unrelated machines ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ Optimal collusion-resistant mechanisms with verification ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
This page was built for publication:
