Makespan minimization in job shops: a polynomial time approximation scheme
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal WDM schedules for optical star networks
IEEE/ACM Transactions on Networking (TON)
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On the solution of reroute sequence planning problem in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Job shop scheduling with unit processing times
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Job Shop Scheduling with Unit Processing Times
Mathematics of Operations Research
Scheduling of a single crane in batch annealing process
Computers and Operations Research
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A fluid approach to large volume job shop scheduling
Journal of Scheduling
A linear time approximation algorithm for permutation flow shop scheduling
Theoretical Computer Science
| Hi-index | 0.05 |