Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Improved bicriteria existence theorems for scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
| Hi-index | 0.89 |
We study the problem of minimizing the average weighted completion time on a single machine under the additional constraint that the sum of completion times does not exceed a given bound B(1|@?C"j=