Scheduling open shops with parallel machines to minimize total completion time (Q609214)
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 5821399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling open shops with parallel machines to minimize total completion time |
scientific article; zbMATH DE number 5821399 |
Statements
Scheduling open shops with parallel machines to minimize total completion time (English)
0 references
30 November 2010
0 references
scheduling
0 references
open shop
0 references
parallel machines
0 references
mathematical model
0 references
mixed integer linear programming
0 references
memetic algorithm
0 references
Taguchi method
0 references
0 references
0 references
0 references
0.7781029939651489
0 references
0.7749668955802917
0 references
0.7737608551979065
0 references
0.7696501016616821
0 references
0.7691594362258911
0 references
