About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Scheduling
Paper
Approximation algorithms for shop scheduling problems with minsum objective: A correction
Abstract
We present a correction to the paper, "Approximation algorithms for shop scheduling problems with minsum objective" (Journal of Scheduling 2002; 5:287-305) by Queyranne and Sviridenko. This correction provides a correct derivation of its 2eρ approximation result. © Springer Science + Business Media, LLC 2006.