Minimizing total completion time in two-machine flow shops with exact delays (Q1000994)
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: Minimizing total completion time in two-machine flow shops with exact delays |
scientific article; zbMATH DE number 5506631
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time in two-machine flow shops with exact delays |
scientific article; zbMATH DE number 5506631 |
Statements
Minimizing total completion time in two-machine flow shops with exact delays (English)
0 references
12 February 2009
0 references
flow shop
0 references
exact delay
0 references
NP-hard
0 references
permutation schedule
0 references
total completion time
0 references
metaheuristics
0 references
0 references
0.9999999
0 references
0 references
0 references
0.94146264
0 references
0.94050944
0 references
0.94050944
0 references
0.93908376
0 references
0.9381248
0 references
0.93767655
0 references
