Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6295567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints |
scientific article; zbMATH DE number 6295567 |
Statements
Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (English)
0 references
15 May 2014
0 references
scheduling
0 references
approximation algorithms
0 references
speed scaling
0 references
alpha-points
0 references
job-dependent convex cost
0 references
weighted tardiness
0 references
0 references
0 references
0 references
0 references
0 references
0.8287003040313721
0 references
0.8247761726379395
0 references
0.8191623687744141
0 references
0.8169554471969604
0 references
0.8125684261322021
0 references
