17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Approximation algorithms for scheduling unrelated parallel machines

      , ,
      Mathematical Programming
      Springer Nature

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references19

          • Record: found
          • Abstract: not found
          • Article: not found

          A Greedy Heuristic for the Set-Covering Problem

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Bounds on Multiprocessing Timing Anomalies

            R L Graham (1969)
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              On the ratio of optimal integral and fractional covers

              L Lovász (1975)
                Bookmark

                Author and article information

                Journal
                Mathematical Programming
                Mathematical Programming
                Springer Nature
                0025-5610
                1436-4646
                January 1990
                January 1990
                : 46
                : 1-3
                : 259-271
                Article
                10.1007/BF01585745
                40ab36e4-e0fc-430b-806f-e0cfa98b3a69
                © 1990
                History

                Comments

                Comment on this article