Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.09.019 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069959731 / rank | |||
Revision as of 05:55, 21 March 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
