Skip to main content
Log in

Graph models for scheduling systems with machine saturation property

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

Let \(T \, =\, \{T_1, T_2, \ldots, T_n\}\) be a set of n independent tasks and \(\mathcal{P}=\{P_1, P_2,\ldots, P_m\}\) a set of m processors. During each time instant, each processor can be used by a single task at most. A schedule is for each task an allocation of one or more time intervals to one or more processors. A schedule is said to be optimal if it minimizes the maximum completion time. We say a schedule S has the machine saturation property (MS property) if, at any time instant of task execution, all the machines are simultaneously busy. In this paper, we analyze the conditions under which a parallel scheduling system allows a schedule with the MS property. While for some simple models the analytical conditions can be easily stated, a graph model approach is required when conflicts of processor usage are present. For this reason, we define the class of saturated graphs that correspond to scheduling systems with the MS property. We present efficient graph recognition algorithms to verify the MS property directly on some classes of saturated graphs

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

Access this article

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

  • Berge C. (1973). Graphs and hypergraphs. North-Holland, Amsterdam, and American Elsevier, New York

  • Brucker P. (2001). Scheduling algorithms. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  • Dell’Olmo P., Giordani S., Speranza MG. (1997a). An approximation result for a duo-processor task scheduling problem. Inf Process Lett 61:195–200

    Article  MathSciNet  Google Scholar 

  • Dell’Olmo P., Speranza MG., Tuza Z. (1997b). Efficiency and effectiveness of normal schedules on three dedicated processors. Discrete Math 164:67–79

    Article  MathSciNet  MATH  Google Scholar 

  • Harary F. (1969). Graph theory. Addison-Wesley, Reading

    Google Scholar 

  • Golumbic MC. (1980). Algorithmic graph theory and perfect graphs. Academic, New York-London-Toronto Ont

    MATH  Google Scholar 

  • Lim CK., Peng YH. (1991). Uniquely pseudointersectable graphs. Ars Combinatoria 32:3–11

    MathSciNet  MATH  Google Scholar 

  • Lovász L. (1972). A characterization of perfect graphs. J Comb Theory B 13:95–98

    Article  MATH  Google Scholar 

  • Opsut RJ, Roberts FS (1981) On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems. In: Chartrand G, Alavi Y, Goldsmith DL, Lesniak-Foster L, Lick DR (eds). The theory and application of graphs. Wiley, New York, pp. 479–192

    Google Scholar 

  • Roberts FS (1985). Application of edge coverings by cliques. Discrete Appl Math 10:93–109

    Article  MathSciNet  MATH  Google Scholar 

  • Scheinerman ER, Trenk AN (1999). On the fractional intersection number of a graph. Graph Comb 15:341–351

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paolo Dell’Olmo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dell’Olmo, P., Gentili, M. Graph models for scheduling systems with machine saturation property. Math Meth Oper Res 63, 329–340 (2006). https://doi.org/10.1007/s00186-005-0016-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-005-0016-6

Keywords

Navigation