A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length

I. Adiri; E. Frostig

doi:10.1016/0167-6377(84)90050-6

A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length

I. Adiri
, E. Frostig

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

Abstract

Consider n jobs (J₁,J₂,...,J_n) and m machines (M₁,M₂...,M_m). Upon completion of processing of J_i, 1 ≤ i ≤ n, on M_j 1 ≤ j ≤ m - 1, it departs with probability p_i or moves to M_j+1 with the complementary probability, 1-p_i. A job completing service on M_m departs. The processing time of j_i on M_j possesses a distribution function F_j. It is proved that sequencing the jobs in a nondecreasing order of p_i minimizes in distribution the schedule length.

Original language	English
Pages (from-to)	101-103
Number of pages	3
Journal	Operations Research Letters
Volume	3
Issue number	2
DOIs	https://doi.org/10.1016/0167-6377(84)90050-6
State	Published - Jun 1984
Externally published	Yes

Keywords

stochastic permutation-flowshop
stochastic scheduling

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/0167-6377(84)90050-6

Cite this

@article{47341b5301f049ff908b242610973af0,

title = "A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length",

abstract = "Consider n jobs (J1,J2,...,Jn) and m machines (M1,M2...,Mm). Upon completion of processing of Ji, 1 ≤ i ≤ n, on Mj 1 ≤ j ≤ m - 1, it departs with probability pi or moves to Mj+1 with the complementary probability, 1-pi. A job completing service on Mm departs. The processing time of ji on Mj possesses a distribution function Fj. It is proved that sequencing the jobs in a nondecreasing order of pi minimizes in distribution the schedule length.",

keywords = "stochastic permutation-flowshop, stochastic scheduling",

author = "I. Adiri and E. Frostig",

year = "1984",

month = jun,

doi = "10.1016/0167-6377(84)90050-6",

language = "English",

volume = "3",

pages = "101--103",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length

AU - Adiri, I.

AU - Frostig, E.

PY - 1984/6

Y1 - 1984/6

N2 - Consider n jobs (J1,J2,...,Jn) and m machines (M1,M2...,Mm). Upon completion of processing of Ji, 1 ≤ i ≤ n, on Mj 1 ≤ j ≤ m - 1, it departs with probability pi or moves to Mj+1 with the complementary probability, 1-pi. A job completing service on Mm departs. The processing time of ji on Mj possesses a distribution function Fj. It is proved that sequencing the jobs in a nondecreasing order of pi minimizes in distribution the schedule length.

AB - Consider n jobs (J1,J2,...,Jn) and m machines (M1,M2...,Mm). Upon completion of processing of Ji, 1 ≤ i ≤ n, on Mj 1 ≤ j ≤ m - 1, it departs with probability pi or moves to Mj+1 with the complementary probability, 1-pi. A job completing service on Mm departs. The processing time of ji on Mj possesses a distribution function Fj. It is proved that sequencing the jobs in a nondecreasing order of pi minimizes in distribution the schedule length.

KW - stochastic permutation-flowshop

KW - stochastic scheduling

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

U2 - 10.1016/0167-6377(84)90050-6

DO - 10.1016/0167-6377(84)90050-6

M3 - Article

AN - SCOPUS:0021452085

SN - 0167-6377

VL - 3

SP - 101

EP - 103

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this