Two-agent scheduling to minimize the total cost (Q421611): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: H. S. Yoon / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6035071 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multi-agent | |||
Property / zbMATH Keywords: multi-agent / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximation algorithm | |||
Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial time approximation scheme | |||
Property / zbMATH Keywords: polynomial time approximation scheme / rank | |||
Normal rank |
Revision as of 20:48, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two-agent scheduling to minimize the total cost |
scientific article |
Statements
Two-agent scheduling to minimize the total cost (English)
0 references
14 May 2012
0 references
scheduling
0 references
multi-agent
0 references
approximation algorithm
0 references
polynomial time approximation scheme
0 references