Minimizing weighted completion time on a single machine
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On the approximability of average completion time scheduling under precedence constraints
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On demand synchronization and load distribution for database grid-based web applications
Data & Knowledge Engineering
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Single machine precedence constrained scheduling is a vertex cover problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Hybrid Petri nets modeling for farm work flow
Computers and Electronics in Agriculture
Proceedings of the 2007 Summer Computer Simulation Conference
Scheduling with Precedence Constraints of Low Fractional Dimension
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Approximating Single Machine Scheduling with Scenarios
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Computers and Operations Research
Resource assignment and scheduling based on a two-phase metaheuristic for cropping system
Computers and Electronics in Agriculture
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the approximability of average completion time scheduling under precedence constraints
Discrete Applied Mathematics
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
A constant factor approximation algorithm for generalized min-sum set cover
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Scheduling with bully selfish jobs
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Mathematics of Operations Research
Vertex cover in graphs with locally few colors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Scheduling partially ordered jobs faster than 2n
ESA'11 Proceedings of the 19th European conference on Algorithms
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
Approximating precedence-constrained single machine scheduling by coloring
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
A 2-approximation algorithm for the network substitution problem
Operations Research Letters
Operations Research Letters
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
Operations Research Letters
Vertex cover in graphs with locally few colors
Information and Computation
Single machine scheduling with scenarios
Theoretical Computer Science
| Hi-index | 0.05 |