A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk

M. Urgo, J. Váncza

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The research in the field of robust scheduling aims at devising schedules which are not sensitive—to a certain extent—to the disruptive effects of unexpected events. Nevertheless, the protection of the schedule from rare events causing heavy losses is still a challenging aim. The paper presents a novel approach for protecting the quality of a schedule by assessing the risk associated to the different scheduling decisions. The approach is applied to a stochastic scheduling problem with a set of jobs to be sequenced on a single machine. The release dates and processing times of the jobs are generally distributed independent random variables, while the due dates are deterministic. A branch-and-bound approach is taken to minimise the value-at-risk of the distribution of the maximum lateness. The viability of the approach is demonstrated through a computational experiment and the application to an industrial problem in the tool making industry.

Original languageEnglish
Pages (from-to)472-496
Number of pages25
JournalFlexible Services and Manufacturing Journal
Volume31
Issue number2
DOIs
Publication statusPublished - Jun 15 2019

Keywords

  • Risk
  • Robust scheduling
  • Stochastic scheduling
  • Value-at-risk

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk'. Together they form a unique fingerprint.

  • Cite this