A time-indexed LP-based approach for min-sum job-shop problems (Q646647)
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 time-indexed LP-based approach for min-sum job-shop problems |
scientific article; zbMATH DE number 5973826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A time-indexed LP-based approach for min-sum job-shop problems |
scientific article; zbMATH DE number 5973826 |
Statements
A time-indexed LP-based approach for min-sum job-shop problems (English)
0 references
17 November 2011
0 references
job-shop
0 references
flow-shop
0 references
total weighted completion time
0 references
time-indexed formulation
0 references
0 references
0 references
0 references
0.7876594066619873
0 references
0.7840586304664612
0 references
0.781485378742218
0 references
0.7779812216758728
0 references
0.7598363161087036
0 references
