scispace - formally typeset
Journal ArticleDOI

Expected shortfall for the makespan in activity networks under imperfect information

Reads0
Chats0
TLDR
The experimental results show that the proposed method can enable to use the expected shortfall as optimization criterion for wide classes of scheduling approaches considering risk-aversion in different practical contexts.
Abstract
This paper deals with the evaluation of the expected shortfall or the conditional value-at-risk for the makespan in scheduling problems represented as temporal networks under incomplete and uncertain information. We consider temporal activity network representations of scheduling problems affected by uncertainties related to the activity durations and we assume that for these uncertainties only incomplete or imperfect information is available. More precisely, for each activity only the interval for its integer valued duration is known to the scheduler. We address the evaluation of the expected shortfall associated to a feasible schedule discussing its importance in scheduling applications. We propose lower and upper bounds, heuristics to determine a fast computational estimation of the expected shortfall, and an exact method for a class of activity networks. The experimental results show that the proposed method can enable to use the expected shortfall as optimization criterion for wide classes of scheduling approaches considering risk-aversion in different practical contexts.

read more

Citations
More filters
Posted Content

Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

TL;DR: In this paper, the performance of several state-of-the-art heuristics from the literature on the basis of a standard set of test instances and point out to the most promising procedures.

Makespan estimation and order acceptance in batch process industries when processing times are uncertain

TL;DR: In this article, a regression-based model is proposed to estimate the makespan of a set of jobs, and three order acceptance policies are compared by means of simulation experiments: a scheduling policy, a workload policy and a regression policy.
Journal ArticleDOI

The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times

TL;DR: An interesting variant of the parallel machine scheduling problem with sequence-dependent setup times, where a subset of jobs has to be selected to guarantee a minimum profit level while the total completion time is minimized, is proposed.
Journal ArticleDOI

A stochastic risk-averse framework for blood donation appointment scheduling under uncertain donor arrivals

TL;DR: Three stochastic counterparts of the preallocation model based on a risk-neutral objective and two risk-averse objectives are proposed, where the Conditional Value-at-Risk is considered as the risk measure in the last two methods.
Journal ArticleDOI

Risk of delay evaluation in real-time train scheduling with uncertain dwell times

TL;DR: A new approach for the assessment of the risk of onset or worsening of delays associated to an rtRTMP solution when dwell times are uncertain and only an interval representation of them is known to the scheduler, using the Conditional-Value-at-Risk of the maximum train delay as risk index.
References
More filters
Book

Scheduling: Theory, Algorithms, and Systems

TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Journal ArticleDOI

Optimization of conditional value-at-risk

R. T. Rockafellar, +1 more
- 01 Jan 2000 - 
TL;DR: In this paper, a new approach to optimize or hedging a portfolio of financial instruments to reduce risk is presented and tested on applications, which focuses on minimizing Conditional Value-at-Risk (CVaR) rather than minimizing Value at Risk (VaR), but portfolios with low CVaR necessarily have low VaR as well.
Book

Digraphs Theory Algorithms And Applications

TL;DR: Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science, and it will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology.
Journal ArticleDOI

PSPLIB - A project scheduling problem library

TL;DR: In this paper, the authors present a set of benchmark instances for the evaluation of solution procedures for single and multi-mode resource-constrained project scheduling problems, which are systematically generated by the standard project generator ProGen.
Journal ArticleDOI

Critical-Path Planning and Scheduling: Mathematical Basis

TL;DR: The essential ingredient of the technique is a mathematical model that incorporates sequence information, durations, and costs for each component of the project that is a special parametric linear program that may be solved efficiently by network flow methods.
Related Papers (5)