A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1134/s000511792302008x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1134/S000511792302008X / rank | |||
Normal rank | |||
Latest revision as of 17:56, 30 December 2024
scientific article; zbMATH DE number 7737072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring |
scientific article; zbMATH DE number 7737072 |
Statements
A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (English)
0 references
13 September 2023
0 references
schedule
0 references
preemption
0 references
makespan optimality
0 references
mixed graph
0 references
optimal coloring
0 references
