Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions (Q6588502)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions |
scientific article; zbMATH DE number 7897710
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions |
scientific article; zbMATH DE number 7897710 |
Statements
Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions (English)
0 references
15 August 2024
0 references
flow shop
0 references
stochastic scheduling
0 references
re-entrant flow shop
0 references
Markovian activity networks
0 references
risk measure
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
