Minimizing total completion time for re-entrant flow shop scheduling problems (Q650903): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:50, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time for re-entrant flow shop scheduling problems |
scientific article |
Statements
Minimizing total completion time for re-entrant flow shop scheduling problems (English)
0 references
7 December 2011
0 references
re-entrant flow shop scheduling
0 references
total completion time
0 references
heuristic algorithm
0 references
lower bound
0 references
