A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling (Q4474071)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2080976
Language Label Description Also known as
default for all languages
No label defined
    English
    A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling
    scientific article; zbMATH DE number 2080976

      Statements

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references