Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints (Q2439528): 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/s11590-012-0582-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2127685766 / rank | |||
Normal rank | |||
Revision as of 03:16, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints |
scientific article |
Statements
Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints (English)
0 references
14 March 2014
0 references
scheduling
0 references
single machine
0 references
\(k\)-partite precedence
0 references
variable job processing times
0 references
maximum cost
0 references
polynomial algorithm
0 references
