Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness (Q4181574): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.2.3.275 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.2.3.275 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040035940 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.2.3.275 / rank | |||
Normal rank | |||
Latest revision as of 09:29, 29 December 2024
scientific article; zbMATH DE number 3617875
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness |
scientific article; zbMATH DE number 3617875 |
Statements
Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness (English)
0 references
1977
0 references
Makespan
0 references
Scheduling
0 references
Treelike Precedence Constraints
0 references
Minimization Of Maximal Lateness
0 references
