An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022)
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: An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time |
scientific article; zbMATH DE number 7373873
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time |
scientific article; zbMATH DE number 7373873 |
Statements
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (English)
0 references
22 July 2021
0 references
scheduling
0 references
semi-online
0 references
competitive analysis
0 references
makespan
0 references
safe set
0 references
0 references
