Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research
A metaheuristic for the fixed job scheduling problem under spread time constraints
Computers and Operations Research
A labeling method for dynamic driver-task assignment with uncertain task durations
Operations Research Letters
A new dominance procedure for combinatorial optimization problems
Operations Research Letters
Tactical fixed job scheduling with spread-time constraints
Computers and Operations Research
Hi-index | 0.00 |