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
Crossref DOI link: https://doi.org/10.1007/s10479-023-05647-1
Published Online: 2023-11-02
Published Print: 2024-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Liu, Lei https://orcid.org/0000-0002-7132-3961
Urgo, Marcello
Text and Data Mining valid from 2023-11-02
Version of Record valid from 2023-11-02
Article History
Received: 18 November 2022
Accepted: 2 October 2023
First Online: 2 November 2023
Declarations
:
: The authors declare that they have no conflict of interest.