Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem (Q6982407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8042220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem |
scientific article; zbMATH DE number 8042220 |
Statements
Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem (English)
0 references
19 May 2025
0 references
scheduling
0 references
identical parallel machines
0 references
multi-criteria
0 references
uncertainty
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
