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

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Cites Work

Unnamed Item
Unnamed Item
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
Minimizing conditional-value-at-risk for stochastic scheduling problems
Minimizing value-at-risk in single-machine scheduling
Statistical treatment choice based on asymmetric minimax regret criteria
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Stochastic dominance and risk measure: a decision-theoretic foundation for VaR and C-VaR
Minimizing total tardiness on a two-machine re-entrant flowshop
New multi-objective method to solve reentrant hybrid flow shop scheduling problem
A numerical study of large sparse matrix exponentials arising in Markov chains.
A heuristic algorithm for two-machine re-entrant shop scheduling
Decomposition methods for reentrant flow shops with sequence-dependent setup times
Distributionally robust single machine scheduling with risk aversion
Heavy-tailed phase-type distributions: a unified approach
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
Flow shops with reentry: reversibility properties and makespan optimal schedules
Risk-averse single machine scheduling: complexity and approximation
Benchmarks for basic scheduling problems
Minimizing makespan on an \(m\)-machine re-entrant flowshop
Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
Exact solutions for the two-machine robust flow shop with budgeted uncertainty
A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics
The Price of Robustness
Bounding the Project Completion Time Distribution in PERT Networks
Minimizing makespan in re-entrant permutation flow-shops
Markov and Markov-Regenerative <scp>pert</scp> Networks
Minimizing makespan on a two-machine re-entrant flowshop
The Greatest of a Finite Set of Random Variables
Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
Scheduling
Constraint programming for the robust two-machine flow-shop scheduling problem with budgeted uncertainty
Conditional value‐at‐risk beyond finance: a survey