Makespan minimization in a no-wait flow shop problem with two batching machines (Q856680)
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: Makespan minimization in a no-wait flow shop problem with two batching machines
scientific article; zbMATH DE number 5078751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Makespan minimization in a no-wait flow shop problem with two batching machines |
scientific article; zbMATH DE number 5078751 |
Statements
Makespan minimization in a no-wait flow shop problem with two batching machines (English)
0 references
7 December 2006
0 references
no-wait flowshop problem
0 references
batch processing machines
0 references
complexity
0 references
0 references
0.8907293081283569
0 references
0.8677409291267395
0 references
0.8535171151161194
0 references
