Approximability and nonapproximability results for minimizing total flow time on a single machine

Abstract

Article Approximability and nonapproximability results for minimizing total flow time on a single machine Share on Authors: Hans Kellerer Institut für Statistik, Ökonometrie und Operations Research, Universität Graz, A-8010 Graz, Austria Institut für Statistik, Ökonometrie und Operations Research, Universität Graz, A-8010 Graz, AustriaView Profile , Thomas Tautenhahn Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg, D-39016 Magdeburg, Germany Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg, D-39016 Magdeburg, GermanyView Profile , Gerhard J. Woeginger Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, NL-5600 MB Eindhoven, The NetherlandsView Profile Authors Info & Claims STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of ComputingJuly 1996 Pages 418–426https://doi.org/10.1145/237814.237989Online:01 July 1996Publication History 54citation413DownloadsMetricsTotal Citations54Total Downloads413Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access