Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716): 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.1016/j.ipl.2004.12.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045000969 / rank | |||
Normal rank | |||
Revision as of 18:15, 19 March 2024
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
