A new heuristic for the n-job, M-machine flow-shop problem (Q2277356)
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: A new heuristic for the n-job, M-machine flow-shop problem |
scientific article; zbMATH DE number 4197726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new heuristic for the n-job, M-machine flow-shop problem |
scientific article; zbMATH DE number 4197726 |
Statements
A new heuristic for the n-job, M-machine flow-shop problem (English)
0 references
1991
0 references
production scheduling
0 references
machine sequencing
0 references
flow-shop scheduling
0 references
heuristic
0 references
simulation
0 references
makespan
0 references
mean flow time
0 references
mean utilization
0 references
0 references
0.8641110062599182
0 references
0.8501055240631104
0 references
0.8486407399177551
0 references
0.8455259203910828
0 references
0.84257572889328
0 references
