Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times (Q3163137)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times |
scientific article |
Statements
Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times (English)
0 references
25 October 2010
0 references
scheduling
0 references
flowshop
0 references
makespan
0 references
random and bounded processing times
0 references
0 references
0 references
0 references
0 references
0 references
0 references
