Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281): 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.orl.2003.12.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037296416 / rank | |||
Normal rank | |||
Revision as of 14:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. |
scientific article |
Statements
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (English)
0 references
11 January 2005
0 references
Sequencing
0 references
Precedence delays
0 references
Makespan
0 references
Computational complexity
0 references
