Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818): 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.1007/s10479-011-1055-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067283563 / rank | |||
Normal rank | |||
Revision as of 00:53, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one |
scientific article |
Statements
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (English)
0 references
15 November 2012
0 references
scheduling
0 references
single machine problems
0 references
maximization problems
0 references
total tardiness
0 references
polynomial algorithm
0 references
