An approximation scheme for the bi-scenario sum of completion times trade-off problem

Miri Gilenson, Hussein Naseraldin, Liron Yedidsion

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

An influential aspect of any scheduling problem is the processing time of the tasks (jobs), which can be deterministic, stochastic, or even uncertain. Scheduling according to unique and known processing times (a.k.a. nominal values) may be naïve, since many production systems are subject to inherent uncertainty. We offer a novel approach for scheduling under uncertainty, inspired by scenario-based optimization. This new approach copes with uncertainty by simultaneously optimizing a given scheduling criterion under two different scenarios of processing times. We term the new problem the bi-scenario trade-off problem. We study the sum of completion times criterion for which we develop a 2-approximation algorithm and show that it is asymptotically tight. We use this approximation to develop the polynomial time approximation scheme that approximates the Pareto-optimal set of solutions and introduce data-dependent analysis to examine the sensitivity of the model parameters.

Original languageEnglish
Pages (from-to)289-304
Number of pages16
JournalJournal of Scheduling
Volume22
Issue number3
DOIs
StatePublished - 15 Jun 2019
Externally publishedYes

Keywords

  • Approximation
  • Bi-scenario
  • PTAS
  • Pareto-optimal
  • Sum of completion times

ASJC Scopus subject areas

  • Software
  • Engineering (all)
  • Management Science and Operations Research
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'An approximation scheme for the bi-scenario sum of completion times trade-off problem'. Together they form a unique fingerprint.

Cite this