Flowshop scheduling problem to minimize total completion time with random and bounded processing times (Q4661102)
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: Flowshop scheduling problem to minimize total completion time with random and bounded processing times |
scientific article; zbMATH DE number 2151588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flowshop scheduling problem to minimize total completion time with random and bounded processing times |
scientific article; zbMATH DE number 2151588 |
Statements
Flowshop scheduling problem to minimize total completion time with random and bounded processing times (English)
0 references
4 April 2005
0 references
scheduling
0 references
flowshop
0 references
uncertainty
0 references
geometrical approach
0 references
total completion time
0 references
0.9023881554603576
0 references
0.8969723582267761
0 references
0.8953617215156555
0 references
0.8845183849334717
0 references
