Single Machine Scheduling with Series-Parallel Precedence Constraints (Q3929382): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.29.6.1195 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.29.6.1195 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095315599 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.29.6.1195 / rank | |||
Normal rank | |||
Latest revision as of 00:15, 22 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single Machine Scheduling with Series-Parallel Precedence Constraints |
scientific article |
Statements
Single Machine Scheduling with Series-Parallel Precedence Constraints (English)
0 references
1981
0 references
series-parallel precedence constraints
0 references
single machine
0 references
minimal total cost
0 references
efficient algorithm
0 references
compact labeling scheme
0 references
series-parallel graphs
0 references
acyclic digraph
0 references
task sequencing
0 references
