Skip to main content
SpringerLink
Log in

On scheduling tasks with exponential service times and in-tree precedence constraints

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper we extend the work of Chandy and Reynolds in which they considered the problem of scheduling tasks on two identical processors. The processing times of the tasks are independent, identically distributed exponential random variables. The tasks are subject to in-tree precedence constraints. Chandy and Reynolds have shown that the expected value of the makespan is minimized if and only if the scheduling policy is Highest-Level-First (HLF). We extend their result by showing that a policy maximizes the probability that all tasks finish by some time t≧0 if and only if the policy is HLF. Additionally, we show that a policy maximizes the probability that the sum of the finishing times of all the tasks is less than some value s≧0 if and only if the policy is HLF.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brucker, P., Garey, M.R., Johnson, D.S.: Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Lateness. Math. Oper. Res. 2, 275–284 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bruno, J.: Deterministic and Stochastic Scheduling Problems with Treelike Precedence Constraints. In: Deterministic and Stochastic Scheduling. Dempster, M.A.H. (J.K. Lenstra, A.H.G. Rinnooy Kan, eds.), pp. 367–374. Boston, USA: D. Reidel Publishing Co. 1982

    Chapter  Google Scholar 

  3. Chandy, K.M., Reynolds, P.F.: Scheduling Partially Ordered Tasks with Negative Exponentially Distributed Times. Technical Report TR-104, Dep. Comput. Sci. University of Texas at Austin

  4. Davida, G.I., Linton, D.J.: A New Algorithm for the Scheduling of Tree Structured Tasks. Proc. Conf. Inf. Sci. Syst., pp. 543–548 Johns Hopkins University (1976)

  5. Hu, T.C.: Parallel Sequencing and Assembly Line Problems. Oper. Res. 9, 841–848 (1961)

    Article  MathSciNet  Google Scholar 

  6. Papadimitrious, C.H.: Games Against Nature. 24th Symp. Found. Comput. Sci., pp. 446–450 (1983)

Download references

Author information

Author notes

  1. John Bruno

    Present address: Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

Authors and Affiliations

  1. The Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    John Bruno

Authors
  1. John Bruno
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been partially supported by a Lady Davis Fellowship at the Technion, Haifa Israel; by the Research Institute for Advanced Computer Science at the NASA Ames Research Center, Moffett Field CA; and by NSF Grant MCS 80-04257.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bruno, J. On scheduling tasks with exponential service times and in-tree precedence constraints. Acta Informatica 22, 139–148 (1985). https://doi.org/10.1007/BF00264227

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264227

Keywords

Search

Navigation