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-Reference-Cited by-同舟云学术

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

Published:2023-11-02 Issue: Volume: Page:
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Liu Lei^ORCID,Urgo Marcello

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

https://link.springer.com/content/pdf/10.1007/s10479-023-05647-1.pdf

Reference65 articles.

1. Angius, A., Horváth, A., & Urgo, M. (2021). A kronecker algebra formulation for markov activity networks with phase-type distributions. Mathematics, 9(12), 1404.

2. Atakan, S., Bülbül, K., & Noyan, N. (2016). Minimizing value-at-risk in single-machine scheduling. Annals of Operations Research, 248(1–2), 25–73.

3. Baker, K. R., & Altheimer, D. (2012). Heuristic solution methods for the stochastic flow shop problem. European Journal of Operational Research, 216(1), 172–177.

4. Baker, K. R., & Trietsch, D. (2010). Three heuristic procedures for the stochastic, two-machine flow shop problem. Journal of Scheduling, 14(5), 445–454.

5. Benavides, A. J., & Vera, A. (2022). The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem. European Journal of Operational Research, 297(2), 407–421.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An upper bound for the inter-exit time of two jobs in an m-machine flow shop;Annals of Operations Research;2024-04-11