An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040)
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 asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan |
scientific article; zbMATH DE number 5550475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan |
scientific article; zbMATH DE number 5550475 |
Statements
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (English)
0 references
4 May 2009
0 references
scheduling
0 references
batching
0 references
non-identical job sizes
0 references
makespan
0 references
asymptotic PTAS
0 references
0 references
0 references
0.989441454410553
0 references
0.8404685854911804
0 references
0.828174352645874
0 references
0.8239792585372925
0 references
