Scheduling tasks with failure probabilities to minimize expected cost

Mordechai I. Henig; David Simchi‐Levi

doi:10.1002/1520-6750(199002)37:1<99::AID-NAV3220370106>3.0.CO;2-5

Scheduling tasks with failure probabilities to minimize expected cost

Mordechai I. Henig^*, David Simchi‐Levi

^*Corresponding author for this work

Coller School of Management

Research output: Contribution to journal › Article › peer-review

Abstract

A project is made of several tasks which can be executed in parallel. Each task is associated with performance cost and failure probability. If all tasks succeed a reward is obtained. We suggest a dynamic programming algorithm to solve the problem of scheduling the tasks in order to maximize the expected discounted profit. We show that the general problem is NP‐complete, but that there are cases where the dynamic programming algorithm is polynomially bounded.

Original language	English
Pages (from-to)	99-109
Number of pages	11
Journal	Naval Research Logistics
Volume	37
Issue number	1
DOIs	https://doi.org/10.1002/1520-6750(199002)37:1<99::AID-NAV3220370106>3.0.CO;2-5
State	Published - Feb 1990

Access to Document

10.1002/1520-6750(199002)37:1<99::AID-NAV3220370106>3.0.CO;2-5

Cite this

@article{850da8feba774edc888084c5f54a6f98,

title = "Scheduling tasks with failure probabilities to minimize expected cost",

abstract = "A project is made of several tasks which can be executed in parallel. Each task is associated with performance cost and failure probability. If all tasks succeed a reward is obtained. We suggest a dynamic programming algorithm to solve the problem of scheduling the tasks in order to maximize the expected discounted profit. We show that the general problem is NP‐complete, but that there are cases where the dynamic programming algorithm is polynomially bounded.",

author = "Henig, {Mordechai I.} and David Simchi‐Levi",

year = "1990",

month = feb,

doi = "10.1002/1520-6750(199002)37:1<99::AID-NAV3220370106>3.0.CO;2-5",

language = "אנגלית",

volume = "37",

pages = "99--109",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley and Sons Inc.",

number = "1",

}

TY - JOUR

T1 - Scheduling tasks with failure probabilities to minimize expected cost

AU - Henig, Mordechai I.

AU - Simchi‐Levi, David

PY - 1990/2

Y1 - 1990/2

N2 - A project is made of several tasks which can be executed in parallel. Each task is associated with performance cost and failure probability. If all tasks succeed a reward is obtained. We suggest a dynamic programming algorithm to solve the problem of scheduling the tasks in order to maximize the expected discounted profit. We show that the general problem is NP‐complete, but that there are cases where the dynamic programming algorithm is polynomially bounded.

AB - A project is made of several tasks which can be executed in parallel. Each task is associated with performance cost and failure probability. If all tasks succeed a reward is obtained. We suggest a dynamic programming algorithm to solve the problem of scheduling the tasks in order to maximize the expected discounted profit. We show that the general problem is NP‐complete, but that there are cases where the dynamic programming algorithm is polynomially bounded.

UR - http://www.scopus.com/inward/record.url?scp=0025388507&partnerID=8YFLogxK

U2 - 10.1002/1520-6750(199002)37:1<99::AID-NAV3220370106>3.0.CO;2-5

DO - 10.1002/1520-6750(199002)37:1<99::AID-NAV3220370106>3.0.CO;2-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0025388507

SN - 0894-069X

VL - 37

SP - 99

EP - 109

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 1

ER -

Scheduling tasks with failure probabilities to minimize expected cost

Abstract

Access to Document

Other files and links

Fingerprint

Cite this