## Abstract

We consider n jobs with independent exponentially distributed processing times that are to be processed on two machines operating in parallel. The jobs are subject to precedence constraints that have the form of an intree, i. e. , each job, except for the last one, has one direct successor. A job is at level l if its successor is at level l-1 (the last job is at level 0). We assume that all jobs at level l have i. i. d. exponentially distributed processing times, wih mean 1/ mu //l. Under these assumptions, we show that the policy that schedules HLF (highest level first) minimizes the expected makespan in the class of preemptive as well as nonpreemptive schedules. This conclusioin generalizes a previous result of K. M. Chandy and P. F. Reynolds.

Original language | English |
---|---|

Pages (from-to) | 1381-1388 |

Number of pages | 8 |

Journal | Operations Research |

Volume | 33 |

Issue number | 6 |

DOIs | |

State | Published - 1985 |

Externally published | Yes |

## ASJC Scopus subject areas

- Computer Science Applications
- Management Science and Operations Research