A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379)
From MaRDI portal
scientific article; zbMATH DE number 7792596
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best possible online algorithm for minimizing the total completion time and the total soft penalty cost |
scientific article; zbMATH DE number 7792596 |
Statements
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (English)
0 references
22 January 2024
0 references
scheduling
0 references
online algorithms
0 references
optimization
0 references
engineering management
0 references
soft penalty
0 references
0 references
0 references
0 references
0 references
0 references
