A hierarchical scheduling problem with a well-solvable second stage

L. Stougie, J.B.G. Frenk, A.H.G. Rinnooy Kan

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    8 Citaten (Scopus)
    3 Downloads (Pure)


    In the hierarchical scheduling model to be considered, the decision at the aggregate level to acquire a number of identical machines has to be based on probabilistic information about the jobs that have to be scheduled on these machines at the detailed level. The objective is to minimize the sum of the acquisition costs and the expected average completion time of the jobs. In contrast to previous models of this type, the second part of this objective function corresponds to a well-solvable scheduling problem that can be solved to optimality by a simple priority rule. A heuristic method to solve the entire problem is described, for which strong asymptotic optimality results can be established.
    Originele taal-2Engels
    Pagina's (van-tot)43-58
    TijdschriftAnnals of Operations Research
    Nummer van het tijdschrift1
    StatusGepubliceerd - 1984

    Vingerafdruk Duik in de onderzoeksthema's van 'A hierarchical scheduling problem with a well-solvable second stage'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit