Using PBIL to minimize makespan for parallel machines scheduling problem with job sequence dependent setup time (Q5034201)
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: Using PBIL to minimize makespan for parallel machines scheduling problem with job sequence dependent setup time |
scientific article; zbMATH DE number 7480937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using PBIL to minimize makespan for parallel machines scheduling problem with job sequence dependent setup time |
scientific article; zbMATH DE number 7480937 |
Statements
24 February 2022
0 references
parallel machines
0 references
scheduling
0 references
population-based incremental learning
0 references
sequence dependent
0 references
0.9005411863327026
0 references
0.7759907841682434
0 references
0.7675265073776245
0 references
0.7601212859153748
0 references
