A Stochastic Scheduling Problem with Intree Precedence Constraints

Esther Frostig
Additional contact information
Esther Frostig: Haifa University, Haifa, Israel

Operations Research, 1988, vol. 36, issue 6, 937-943

Abstract: We consider n jobs to be scheduled on two parallel machines. The jobs are subject to intree precedence constraints, that is, each job, except one which is the root of the tree, has one successor. The job of the root is at level 0 and a job is at level l if its predecessor is at level l − 1. A job can start to be processed only after all its predecessors have finished. Job processing times are independent random variables with those at the same level being identically distributed. The objective is to minimize the expected completion time of the last job. Such a model can be applied to assembly line and computational problems. This paper generalizes a result of Pinedo and Weiss.

Keywords: production/scheduling: stochastic; reliability: life distributions (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.6.937 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:36:y:1988:i:6:p:937-943

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().