A new heuristic for the n-job, M-machine flow-shop problem (Q2277356): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(91)90080-f / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019192981 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 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
0 references
