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

Miri Gilenson, Hussein Naseraldin and Liron Yedidsion ()
Additional contact information
Miri Gilenson: Ben Gurion University
Hussein Naseraldin: ORT Braude College of Engineering
Liron Yedidsion: Technion

Journal of Scheduling, 2019, vol. 22, issue 3, No 3, 289-304

Abstract: 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.

Keywords: Approximation; Sum of completion times; Bi-scenario; PTAS; Pareto-optimal (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-018-0588-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:22:y:2019:i:3:d:10.1007_s10951-018-0588-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-018-0588-7

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().