Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545): 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.1016/0377-2217(95)00347-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160959723 / rank | |||
Normal rank | |||
Revision as of 23:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems |
scientific article |
Statements
Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (English)
0 references
22 February 1999
0 references
flow shop scheduling
0 references
sum of job completion times
0 references
machine idle times
0 references
job queue times
0 references
