Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091)
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: Minimization of the makespan in a two-machine problem under given resource constraints |
scientific article; zbMATH DE number 1314776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimization of the makespan in a two-machine problem under given resource constraints |
scientific article; zbMATH DE number 1314776 |
Statements
Minimization of the makespan in a two-machine problem under given resource constraints (English)
0 references
11 July 1999
0 references
transferable resource
0 references
linear model
0 references
two-machine flow-shop
0 references
0 references
0 references
0 references
0.8806350827217102
0 references
0.8405905365943909
0 references
0.838991105556488
0 references
0.8227846622467041
0 references
