Minimizing the expected weighted number of tardy jobs in stochastic flow shops

O.J. Boxma, F.G. Forst

    Research output: Contribution to journalArticleAcademicpeer-review

    42 Citations (Scopus)
    1 Downloads (Pure)


    This paper is devoted to two types of stochastic scheduling problems, one involving a single machine and the other involving a flow shop consisting of an arbitrary number of machines. In both problem types, all jobs to be processed have due dates, and the objective is to find a job sequence that minimizes the expected weighted number of tardy jobs. For the single-machine case, sufficient optimality conditions for job sequences are derived for various choices of due date and processing time distributions. For the case of a flow shop with an arbitrary number of machines and identically distributed due dates for all jobs, we prove the following intuitively appealing results: (i) when all jobs have the same processing time distributions, the expected weighted number of tardy jobs is minimized by sequencing the jobs in decreasing order of the weights, (ii) when all weights are equal, the jobs should be sequenced according to an increasing stochastic ordering of the processing time distributions.
    Original languageEnglish
    Pages (from-to)119-126
    Number of pages8
    JournalOperations Research Letters
    Issue number3
    Publication statusPublished - 1986


    Dive into the research topics of 'Minimizing the expected weighted number of tardy jobs in stochastic flow shops'. Together they form a unique fingerprint.

    Cite this