Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Setting optimal due dates in a basic safe-scheduling model
Single machine scheduling problem with interval processing times to minimize mean weighted completion time
Minimizing conditional-value-at-risk for stochastic scheduling problems
Minimizing value-at-risk in single-machine scheduling
Criticality analysis of activity networks under interval uncertainty
A rollout metaheuristic for job shop scheduling problems
Project bidding under deterministic and probabilistic activity durations
Experimental investigation of heuristics for resource-constrained project scheduling: an update
Risk-averse profit-based optimal scheduling of a hydro-chain in the day-ahead electricity market
Shortfall as a risk measure: properties, optimization and applications
Evaluating project completion time in project networks with discrete random activity durations
A quantile-based approach to system selection
Computing latest starting times of activities in interval-valued networks with minimal time lags
PSPLIB -- a project scheduling problem library
A fuzzy robust scheduling approach for product development projects.
Project scheduling. A research handbook.
Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
A fuzzy project scheduling approach to minimize schedule risk for product development
Distributionally robust single machine scheduling with risk aversion
Expected shortfall: heuristics and certificates
On computing the latest starting times and floats of activities in a network with imprecise durations
Project scheduling under uncertainty: survey and research potentials
On the fallacy of averages in project risk management
Makespan estimation and order acceptance in batch process industries when processing times are uncertain
Rescheduling manufacturing systems: A framework of strategies, policies, and methods
A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
Appointment scheduling with a quantile objective
Sequencing with uncertain numerical data for makespan minimisation
Critical-Path Planning and Scheduling: Mathematical Basis
Principles of Sequencing and Scheduling
Stochastic Scheduling with Release Dates and Due Dates
Optimal Reduction of Two-Terminal Directed Acyclic Graphs
Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
Expected Critical Path Lengths in PERT Networks
Manufacturing Scheduling Systems
The computational complexity of the criticality problems in a network with interval activity times

This page was built for publication: Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks