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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.apm.2013.02.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.APM.2013.02.003 / rank | |||
Normal rank | |||
Latest revision as of 09:12, 16 December 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
0 references
0 references
0 references
0 references
0 references
0 references
