Makespan minimization in job shops: a polynomial time approximation scheme
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling with job release dates, delivery times and preemption penalties
Information Processing Letters
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
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
Order Assignment and Scheduling in a Supply Chain
Operations Research
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
Computers and Operations Research
Note: A best on-line algorithm for single machine scheduling with small delivery times
Theoretical Computer Science
Computers and Operations Research
Jackson's semi-preemptive scheduling on a single machine
Computers and Operations Research
Approximation algorithms for scheduling a single machine to minimize total late work
Operations Research Letters
A polynomial approximation scheme for problem F2/rj/Cmax
Operations Research Letters
An open shop scheduling problem with a non-bottleneck machine
Operations Research Letters
A linear time approximation scheme for makespan minimization in an open shop with release dates
Operations Research Letters
Multi-location production and delivery with job selection
Computers and Operations Research
Discrete Applied Mathematics
| Hi-index | 0.00 |