Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing

This publication has 12 references indexed in Scilit:

• Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
  SIAM Journal on Discrete Mathematics, 2003
• Improved Bounds for Acyclic Job Shop Scheduling
  Combinatorica, 2002
• Better Approximation Guarantees for Job-Shop Scheduling
  SIAM Journal on Discrete Mathematics, 2001
• A New Algorithm for State-Constrained Separated Continuous Linear Programs
  SIAM Journal on Control and Optimization, 1998
• On some geometric methods in scheduling theory: a survey
  Discrete Applied Mathematics, 1994
• Improved Approximation Algorithms for Shop Scheduling Problems
  SIAM Journal on Computing, 1994
• An Algorithm for a Class of Continuous Linear Programs
  SIAM Journal on Control and Optimization, 1993
• An Algorithm for Solving the Job-Shop Problem
  Management Science, 1989
• Bounding algorithm for the routing problem with arbitrary paths and alternative servers
  Cybernetics and Systems Analysis, 1987
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  Mathematics of Operations Research, 1977