An asymptotically optimal algorithm for job shop scheduling
暂无分享,去创建一个
[1] S. Sevast’yanov. Bounding algorithm for the routing problem with arbitrary paths and alternative servers , 1986 .
[2] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[3] David B. Shmoys,et al. Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.
[4] M. Pullan. An algorithm for a class of continuous linear programs , 1993 .
[5] Gideon Weiss,et al. On optimal draining of re-entrant fluid lines , 1995 .
[6] Aravind Srinivasan,et al. Better approximation guarantees for job-shop scheduling , 1997, SODA '97.
[7] D. Bertsimas,et al. A New Algorithm for State-Constrained Separated Continuous Linear Programs , 1999 .
[8] David Gamarnik,et al. Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing , 1999, J. Algorithms.
[9] V. S,et al. On some geometric methods in scheduling theory : a survey , 2001 .