Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-014-9744-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085518973 / rank | |||
Normal rank | |||
Revision as of 19:43, 19 March 2024
scientific article; zbMATH DE number 6544309
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan |
scientific article; zbMATH DE number 6544309 |
Statements
Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (English)
0 references
23 February 2016
0 references
two-agent scheduling
0 references
parallel machines
0 references
makespan
0 references
approximation algorithm
0 references
