A new heuristic for the n-job, M-machine flow-shop problem (Q2277356): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:58, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new heuristic for the n-job, M-machine flow-shop problem |
scientific article |
Statements
A new heuristic for the n-job, M-machine flow-shop problem (English)
0 references
1991
0 references
production scheduling
0 references
machine sequencing
0 references
flow-shop scheduling
0 references
heuristic
0 references
simulation
0 references
makespan
0 references
mean flow time
0 references
mean utilization
0 references
