Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization |
scientific article; zbMATH DE number 7962648
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization |
scientific article; zbMATH DE number 7962648 |
Statements
Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (English)
0 references
7 January 2025
0 references
multi-agent scheduling
0 references
parallel machines
0 references
Pareto front
0 references
genetic algorithms
0 references
integer programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
