A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates (Q4245645)
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 new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates |
scientific article; zbMATH DE number 1297342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates |
scientific article; zbMATH DE number 1297342 |
Statements
A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates (English)
0 references
1998
0 references
0.8043572902679443
0 references
0.7715451121330261
0 references
0.7647451758384705
0 references
