Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324)
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: Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem |
scientific article; zbMATH DE number 6389259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem |
scientific article; zbMATH DE number 6389259 |
Statements
Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (English)
0 references
22 January 2015
0 references
optimization
0 references
jobshop
0 references
approximations
0 references
heuristics
0 references
0 references
0 references
0.8314939141273499
0 references
0.8270254731178284
0 references
0.8075046539306641
0 references
0.8070053458213806
0 references
