Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Scheduling with release dates on a single machine to minimize total weighted completion time
Discrete Applied Mathematics
A time indexed formulation of non-preemptive single machine scheduling problems
Mathematical Programming: Series A and B
Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Supermodular Relaxation for Scheduling with Release Dates
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Random-Based Scheduling: New Approximations and LP Lower Bounds
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Algorithms for total weighted completion time scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Balance scheduling: weighting branch tradeoffs in superblocks
Proceedings of the 32nd annual ACM/IEEE international symposium on Microarchitecture
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
An Experimental Study of Online Scheduling Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An experimental study of online scheduling algorithms
Journal of Experimental Algorithmics (JEA)
Solving Project Scheduling Problems by Minimum Cut Computations
Management Science
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Machine scheduling performance with maintenance and failure
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |