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

O.J. Boxma, F.G. Forst

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    42 Citaten (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.
    Originele taal-2Engels
    Pagina's (van-tot)119-126
    Aantal pagina's8
    TijdschriftOperations Research Letters
    Nummer van het tijdschrift3
    StatusGepubliceerd - 1986


    Duik in de onderzoeksthema's van 'Minimizing the expected weighted number of tardy jobs in stochastic flow shops'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit