A time-indexed LP-based approach for min-sum job-shop problems (Q646647): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-010-0832-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994945816 / rank | |||
Normal rank | |||
Revision as of 22:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A time-indexed LP-based approach for min-sum job-shop problems |
scientific article |
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
