Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716)
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: Approximation results for a bicriteria job scheduling problem on a single machine without preemption |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation results for a bicriteria job scheduling problem on a single machine without preemption |
scientific article |
Statements
Approximation results for a bicriteria job scheduling problem on a single machine without preemption (English)
0 references
4 December 2009
0 references
approximation algorithms
0 references
bicriteria optimization
0 references
single machine scheduling
0 references
approximate Pareto curve
0 references
0 references
0 references
0 references
