Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2011.09.019 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2011.09.019 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two branch-and-bound algorithms for the robust parallel machine scheduling problem |
scientific article |
Statements
Two branch-and-bound algorithms for the robust parallel machine scheduling problem (English)
0 references
15 November 2012
0 references
robust scheduling
0 references
identical parallel machines
0 references
stochastic processing times
0 references
0 references
0 references
0 references
0 references
0 references
