A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:14, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times |
scientific article |
Statements
A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (English)
0 references
9 October 2018
0 references
scheduling
0 references
flowshop
0 references
makespan
0 references
random and bounded processing times
0 references
setup times
0 references
