Sequencing an N-stage process with feedback

Uri Yechiali

doi:10.1017/S0269964800000784

Sequencing an N-stage process with feedback

Uri Yechiali^*

^*Corresponding author for this work

School of Mathematical Sciences

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

11 Scopus citations

Abstract

N tasks must be successfully performed for a job to be completed. The tasks may be attempted in any order, where each attempt of task i requires an expected cost c_i and is successful with probability p_i. Whenever an attempt fails, the job is fed back to the initial stage and the entire sequence starts again. We show that the cost of completing a job is minimized if the tasks are sequenced via increasing values of c_i/(1 − p_i). We further show that the same result holds when the feedback can be either to stage i itself or to the starting task.

Original language	English
Pages (from-to)	263-265
Number of pages	3
Journal	Probability in the Engineering and Informational Sciences
Volume	2
Issue number	2
DOIs	https://doi.org/10.1017/S0269964800000784
State	Published - Apr 1988

Access to Document

10.1017/S0269964800000784

Cite this

@article{e70d5d4fa28c4c49b41a52867e3501b8,

title = "Sequencing an N-stage process with feedback",

abstract = "N tasks must be successfully performed for a job to be completed. The tasks may be attempted in any order, where each attempt of task i requires an expected cost ci and is successful with probability pi. Whenever an attempt fails, the job is fed back to the initial stage and the entire sequence starts again. We show that the cost of completing a job is minimized if the tasks are sequenced via increasing values of ci/(1 − pi). We further show that the same result holds when the feedback can be either to stage i itself or to the starting task.",

author = "Uri Yechiali",

year = "1988",

month = apr,

doi = "10.1017/S0269964800000784",

language = "אנגלית",

volume = "2",

pages = "263--265",

journal = "Probability in the Engineering and Informational Sciences",

issn = "0269-9648",

publisher = "Cambridge University Press",

number = "2",

}

TY - JOUR

T1 - Sequencing an N-stage process with feedback

AU - Yechiali, Uri

PY - 1988/4

Y1 - 1988/4

N2 - N tasks must be successfully performed for a job to be completed. The tasks may be attempted in any order, where each attempt of task i requires an expected cost ci and is successful with probability pi. Whenever an attempt fails, the job is fed back to the initial stage and the entire sequence starts again. We show that the cost of completing a job is minimized if the tasks are sequenced via increasing values of ci/(1 − pi). We further show that the same result holds when the feedback can be either to stage i itself or to the starting task.

AB - N tasks must be successfully performed for a job to be completed. The tasks may be attempted in any order, where each attempt of task i requires an expected cost ci and is successful with probability pi. Whenever an attempt fails, the job is fed back to the initial stage and the entire sequence starts again. We show that the cost of completing a job is minimized if the tasks are sequenced via increasing values of ci/(1 − pi). We further show that the same result holds when the feedback can be either to stage i itself or to the starting task.

UR - https://www.scopus.com/pages/publications/84976024613

U2 - 10.1017/S0269964800000784

DO - 10.1017/S0269964800000784

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

AN - SCOPUS:84976024613

SN - 0269-9648

VL - 2

SP - 263

EP - 265

JO - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

IS - 2

ER -

Sequencing an N-stage process with feedback

Abstract

Access to Document

Other files and links

Fingerprint

Cite this