Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop |
scientific article; zbMATH DE number 7636623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop |
scientific article; zbMATH DE number 7636623 |
Statements
Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (English)
0 references
23 December 2022
0 references
two competitive agents
0 references
open-shop scheduling
0 references
makespan
0 references
approximation algorithm
0 references
0 references
0.89707977
0 references
0.89032274
0 references
0.8890332
0 references
0.8860328
0 references
0.88229406
0 references
0.88226926
0 references
0 references
0.8790772
0 references
