Asymptotically Optimal Algorithm For Job Shop Scheduling and Packet Routing

By: Dimitris Bertsimas, David Gamarnik

Published in: Journal of Algorithms, volume 33, (no 2), pages 296-318 in 1999

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to reports@us.ibm.com .