Abstract
In this paper, we consider the on-line scheduling of jobs that may be competing for mutually exclusive resources. We model the conflicts between jobs with a conflict graph, so that the set of all concurrently running jobs must form an independent set in the graph. This model is natural and general enough to have applications in a variety of settings; however, we are motivated by the following two specific applications: traffic intersection control and session scheduling in high speed local area networks with spatial reuse. Our results focus on two special classes of graphs motivated by our applications: bipartite graphs and interval graphs. The cost function we use is maximum response time. In all of the upper bounds, we devise algorithms which maintain a set of invariants which bound the accumulation of jobs on cliques (in the case of bipartite graphs, edges) in the graph. The lower bounds show that the invariants maintained by the algorithms are tight to within a constant factor. For a specific graph which arises in the traffic intersection control problem, we show a simple algorithm which achieves the optimal competitive ratio.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.REFERENCES
Al-Deek, H. M., S. S. Ishak, and A. E. Radwan, “Impact of traffic diversion with ATIS on travelers' safety,” Comput. Indust. Eng., 34, 547-558 (1998).
Al-Deek, H. M. and A. Kanafani, “Modeling the benefits of advanced traveler information systems in corridors with incidents,” Transportation Res. Part C, 1, 303-324 (1993).
Aspnes, J., Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, “On-line routing of virtual circuits with applications to load balancing and machine scheduling,” JACM, 44(3), 486-504 (May 1997).
Baker, B. S. and E. G. Coffman, Jr., “Mutual exclusion scheduling,” Theoret. Comput. Sci., 162, 225-243 (1996).
Bar-Ilan, J. and D. Peleg, “Distributed resource allocation algorithms,” in A. Segall S. Zaks (eds.), Proc. 6th Int. Workshop on Distributed Algorithms, Springer-Verlag, New York, 1992, pp. 277-291.
Bar-Noy, A., A. Mayer, B. Schieber, and M. Sudan, “Guaranteeing fair service to persistent dependent tasks,” SIAM J. Comput., 27(4), 1168-1189 (August 1998).
Bodlaender, H. L. and K. Jansen, “On the complexity of scheduling incompatible jobs with unit-times,” in A. M. Borzyszkowski S. Sokolowski (eds.), Mathematical Foundations of Computer Science, Springer-Verlag, Berlin, 1993, pp. 291-300.
Bodlaender, H. L., K. Jansen, and G. J. Woeginger, “Scheduling with incompatible jobs,” Discrete Appl. Math., 55, 219-232 (1994).
Borodin, A. and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, New York, 1998.
Bullock, D. and C. Hendrickson, “Roadway traffic control software,” IEEE Trans. Control Syst. Tech., 2, 255-264 (1994).
Chandy, K. and J. Misra, “The drinking philosophers problem,” ACM Trans. Programming Lang. Syst., 6, 632-646 (1984).
Chen, J., I. Cidon, and Y. Ofek, “A local fairness algorithm for gigabit LANs/MANs with spatial reuse,” IEEE J. Selected Areas Comm., 11, 1183-1192 (1993).
Choy, M., and A. K. Singh, “Efficient fault-tolerant algorithms for distributed resource allocation,” ACM Trans. on Programming Lang. Syst., 17(3), 535-559 (May 1995).
Coffman, E. G., Jr., A. Feldmann, N. Kahale, and B. Poonen, “Computing call admission capacities in linear networks,” Prob. Eng. Inf. Sci., 13, 387-406 (1999).
Coffman, E. G., Jr., P. Robert, and A. L. Stolyar, “The interval packing process of linear networks,” Performance Evaluation Rev., 27(3), 3-4 (December 1999).
Dijkstra, E. W., “Hierarchical ordering of sequential processes,” Acta Inform., 1, 115-138 (1971).
Fenton, R. E., “IVHS/AHS: driving into the future,” IEEE Control Syst. Mag., 14(6), 13-20 (December 1994).
Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
Jansen, K., “Scheduling of incompatible jobs on unrelated machines,” Int. J. Found. Comput. Sci., 4, 275-291 (1993).
Karp, R. M., “Reducibility among combinatorial problems,” in R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum, New York, 1972, pp. 85-103.
Khattak, A. J., J. L. Schofer, and F. S. Koppelman, “Commuters' enroute diversion and return decisions: analysis and implications for advanced traveler information systems,” Transportation Res. Part A, 27, 101-111 (1993).
Koutsoupias, E. and C. H. Papadimitriou, “Beyond competitive analysis,” in Proc. 35th Symp. on the Foundations of Computer Science, IEEE Computer Society, Washington, DC, 1994, pp. 394-400.
Lund, C. and M. Yannakakis, “On the hardness of approximating minimization problem,” J. Assoc. Comput. Machinery, 41(5), 960-981 (September 1994).
Lynch, N., “Upper bounds for static resource allocation in a distributed system,” J. Comput. Syst. Sci., 23, 254-278 (1981).
Motwani, R., S. Phillips, and E. Torng, “Non-clairvoyant scheduling,” Theor. Comput. Sci., 130(1), 17-47 (August 1994).
Renz, P. L., “Intersection representations of graphs by arcs,” Pacific J. Math., 34, 501-510 (1970).
Schaffter, M. W., “Scheduling with forbidden sets,” Discrete Appl. Math., 72, 155-166 (1997).
Webster, F. V., Traffic Signal Settings, Her Majesty's Stationery Office, London, 1958.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Irani, S., Leung, V. Scheduling with Conflicts on Bipartite and Interval Graphs. Journal of Scheduling 6, 287–307 (2003). https://doi.org/10.1023/A:1022908509269
Issue Date:
DOI: https://doi.org/10.1023/A:1022908509269