A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694)
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 note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines |
scientific article; zbMATH DE number 6544383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines |
scientific article; zbMATH DE number 6544383 |
Statements
A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (English)
0 references
23 February 2016
0 references
flowshop scheduling
0 references
batch-processing machine
0 references
bin-packing
0 references
approximation algorithm
0 references
worst-case performance analysis
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8565275073051453
0 references
0.8512670993804932
0 references
0.8389276266098022
0 references
0.8335738778114319
0 references
