Bi-criteria scheduling on a single parallel-batch machine (Q437901): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6058805 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bi-criteria scheduling | |||
Property / zbMATH Keywords: bi-criteria scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complexity | |||
Property / zbMATH Keywords: complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Pareto-optimal solution | |||
Property / zbMATH Keywords: Pareto-optimal solution / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fully polynomial-time approximation scheme | |||
Property / zbMATH Keywords: fully polynomial-time approximation scheme / rank | |||
Normal rank |
Revision as of 01:23, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bi-criteria scheduling on a single parallel-batch machine |
scientific article |
Statements
Bi-criteria scheduling on a single parallel-batch machine (English)
0 references
20 July 2012
0 references
bi-criteria scheduling
0 references
complexity
0 references
Pareto-optimal solution
0 references
fully polynomial-time approximation scheme
0 references