SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Scheduling Two Machines with Release Times
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Note: A best on-line algorithm for single machine scheduling with small delivery times
Theoretical Computer Science
Scheduling hybrid flowshop with parallel batching machines and compatibilities
Computers and Operations Research
Journal of Scheduling
Scheduling jobs with release dates on parallel batch processing machines
Discrete Applied Mathematics
Note: Minimizing makespan with release times on identical parallel batching machines
Discrete Applied Mathematics
Core instances for testing: a case study
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Scheduling an unbounded batch machine to minimize maximum lateness
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Algorithms and theory of computation handbook
Scheduling jobs on heterogeneous platforms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A polynomial approximation scheme for problem F2/rj/Cmax
Operations Research Letters
Approximation algorithms for the multiprocessor open shop scheduling problem
Operations Research Letters
Scheduling on identical machines: How good is LPT in an on-line setting?
Operations Research Letters
Scheduling on uniform parallel machines to minimize maximum lateness
Operations Research Letters
A linear time approximation scheme for makespan minimization in an open shop with release dates
Operations Research Letters
A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Tabu search and lower bounds for a combined production-transportation problem
Computers and Operations Research
Semi-online scheduling for jobs with release times
Journal of Combinatorial Optimization
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...