Ordinal On-Line Scheduling on Two Uniform Machines
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Semi-online scheduling with machine cost
Journal of Computer Science and Technology
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks
Journal of Scheduling
Preemptive semi-online scheduling with tightly-grouped processing times
Journal of Computer Science and Technology
Optimal preemptive semi-online scheduling on two uniform processors
Information Processing Letters
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
Theoretical Computer Science
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics - Special issue: Max-algebra
Optimal semi-online algorithms for machine covering
Theoretical Computer Science
Semi-online scheduling problems on two identical machines with inexact partial information
Theoretical Computer Science
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
Computers and Operations Research
Semi on-line scheduling on three processors with known sum of the tasks
Journal of Scheduling
List scheduling for jobs with arbitrary release times and similar lengths
Journal of Scheduling
Semi-online scheduling on two uniform processors
Theoretical Computer Science
Semi-online algorithms for scheduling with machine cost
Journal of Computer Science and Technology
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics
Optimal preemptive semi-online scheduling on two uniform processors
Information Processing Letters
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization
Semi-online scheduling with known partial information about job sizes on two identical machines
Theoretical Computer Science
An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
Journal of Combinatorial Optimization
Optimal semi-online algorithm for scheduling with rejection on two uniform machines
Journal of Combinatorial Optimization
Semi-online problems on identical machines with inexact partial information
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Linear time algorithms for parallel machine scheduling
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Online scheduling with reassignment
Operations Research Letters
Online and semi-online scheduling of two machines under a grade of service provision
Operations Research Letters
Semi-on-line scheduling with ordinal data on two uniform machines
Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information
Operations Research Letters
Several semi-online scheduling problems on two identical machines with combined information
Theoretical Computer Science
Optimal semi-online algorithms for scheduling with machine activation cost
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Optimal semi-online scheduling algorithms on a small number of machines
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Semi-online scheduling problems on a small number of machines
Journal of Scheduling
Semi-online scheduling for jobs with release times
Journal of Combinatorial Optimization
Hi-index | 0.01 |