Annals of Operations Research

, Volume 1, Issue 1, pp 43–58 | Cite as

A hierarchical scheduling problem with a well-solvable second stage

  • J. B. G. Frenk
  • A. H. G. Rinnooy Kan
  • L. Stougie
Stochastic Programming

Abstract

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.

Keywords and phrases

Hierarchical planning models identical machine scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© J.C. Baltzer A.G., Scientific Publishing Company 1984

Authors and Affiliations

  • J. B. G. Frenk
    • 1
  • A. H. G. Rinnooy Kan
    • 1
  • L. Stougie
    • 2
  1. 1.Econometric InstituteErasmus UniversityRotterdamThe Netherlands
  2. 2.Centrum voor Wiskunde en InformaticaAmsterdamThe Netherlands

Personalised recommendations