Scheduling Algorithm to Select Optimal Programme Slots in Television Channels: A Graph Theoretic Approach

In this paper, it is shown that all programmes of all television channels can be modelled as an interval graph. The programme slots are taken as the vertices of the graph and if the time duration of two programme slots have non-empty intersection, the corresponding vertices are considered to be connected by an edge. The number of viewers of a programme is taken as the weight of the vertex. A set of programmes that are mutually exclusive in respect of time scheduling is called a session. We assume that a company sets the objective of selecting the popular programmes in k parallel sessions among different channels so as to make its commercial advertisement reach the maximum number of viewers, that is, a company selects k suitable programme slots simultaneously for advertisement. The aim of the paper is, therefore, to help the companies to select the programme slots, which are mutually exclusive with respect to the time schedule of telecasting time, in such a way that the total number of viewers of the selected programme in k parallel slots rises to the optimum level. It is shown that the solution of this problem is obtained by solving the maximum weight k-colouring problem on an interval graph. An algorithm is designed to solve this just-in-time optimization problem using $$O(kMn^2)$$O(kMn2) time, where n and M represent the total number of programmes of all channels and the upper bound of the viewers of all programmes of all channels respectively. The problem considered in this paper is a daily life problem which is modeled by k-colouring problem on interval graph.

[1]  Aziz Moukrim,et al.  An exact method for graph coloring , 2006, Comput. Oper. Res..

[2]  Egon Balas,et al.  Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1991, SIAM J. Comput..

[3]  Madhumangal Pal,et al.  Selection of programme slots of television channels for giving advertisement: A graph theoretic approach , 2007, Inf. Sci..

[4]  Nicolas Zufferey,et al.  Graph colouring approaches for a satellite range scheduling problem , 2008, J. Sched..

[5]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[6]  Dvir Shabtay,et al.  The just-in-time scheduling problem in a flow-shop scheduling system , 2012, Eur. J. Oper. Res..

[7]  Joan Boyar,et al.  Coloring Planar Graphs in Parallel , 1987, J. Algorithms.

[8]  Ton Kloks,et al.  A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs , 1993, J. Algorithms.

[9]  Madhumangal Pal,et al.  An efficient algorithm to generate all maximal independent sets on trapezoid graphs , 1999, Int. J. Comput. Math..

[10]  Peter Rajcáni.  Optimal Parallel 3-Coloring Algorithm for Rooted Trees and its Applications , 1992, Inf. Process. Lett..

[11]  Madhumangal Pal,et al.  An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs , 2001, Comput. Optim. Appl..

[12]  Dvir Shabtay,et al.  Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times , 2013, Journal of Scheduling.

[13]  Thomas Stützle,et al.  An Analysis of Heuristics for Vertex Colouring , 2010, SEA.

[14]  Madhumangal Pal,et al.  Intersection Graphs: An Introduction , 2014, ArXiv.

[15]  Nicolas Zufferey,et al.  Ant Local Search and its efficient adaptation to graph colouring , 2010, J. Oper. Res. Soc..

[16]  Madhumangal Pal.  A parallel algorithm to generate all maximal independent sets on permutation graphs , 1998, Int. J. Comput. Math..

[17]  Paolo Toth,et al.  A Metaheuristic Approach for the Vertex Coloring Problem , 2008, INFORMS J. Comput..

[18]  Paolo Dell'Olmo,et al.  Coloring graphs by iterated local search traversing feasible and infeasible solutions , 2008, Discret. Appl. Math..

[19]  András Gyárfás,et al.  Covering and coloring problems for relatives of intervals , 1985, Discret. Math..

[20]  Koichi Yamazaki,et al.  A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..

[21]  Madhumangal Pal,et al.  An efficient pram algorithm for maximum-weight independent set on permutation graphs , 2005 .

[22]  Rhyd Lewis,et al.  A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing , 2009, Comput. Oper. Res..

[23]  Egon Balas,et al.  Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1992, SIAM J. Comput..

[24]  Pedro M. Talaván,et al.  The graph coloring problem: A neuronal network approach , 2008, Eur. J. Oper. Res..

[25]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[26]  F. Roberts.  Graph Theory and Its Applications to Problems of Society , 1987 .

[27]  Jin-Kao Hao,et al.  A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..

[28]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[29]  Madhumangal Pal,et al.  An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs , 2002, Int. J. Comput. Math..

[30]  Mihalis Yannakakis,et al.  The Maximum k-Colorable Subgraph Problem for Chordal Graphs , 1987, Inf. Process. Lett..

[31]  Wojciech Rytter,et al.  Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract) , 1989, MFCS.

[32]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[33]  Chirag M. Patel,et al.  An ant-based algorithm for coloring graphs , 2008, Discret. Appl. Math..

[34]  Yu Liu,et al.  Towards Maximum Independent Sets on Massive Graphs , 2015, Proc. VLDB Endow..

[35]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..

[36]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[37]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[38]  Madhumangal Pal,et al.  Maximum weight k-independent set problem on permutation graphs , 2003, Int. J. Comput. Math..

[39]  Sasanka Roy,et al.  Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models , 2014, CCCG.

[40]  Maciej Slusarek.  A Coloring Algorithm for Interval Graphs , 1989, MFCS.

[41]  Alain Hertz,et al.  An adaptive memory algorithm for the k-coloring problem , 2003, Discret. Appl. Math..

[42]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[43]  Robin Thomas,et al.  Independent sets in triangle-free cubic planar graphs , 2006, J. Comb. Theory, Ser. B.

[44]  Glenn K. Manacher,et al.  A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone , 2002, Networks.

[45]  Vadim V. Lozin,et al.  Independent Sets of Maximum Weight in Apple-Free Graphs , 2008, SIAM J. Discret. Math..

[46]  Eugene Levner,et al.  An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem , 2013, J. Sched..

[47]  Antonio Sassano,et al.  An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs , 2015, ArXiv.

[48]  Vadim V. Lozin,et al.  On the Maximum Independent Set Problem in Subclasses of Planar Graphs , 2010, J. Graph Algorithms Appl..

[49]  Moni Naor,et al.  Fast parallel algorithms for chordal graphs , 1987, SIAM J. Comput..

[50]  Richard C. T. Lee,et al.  Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs , 1988, Inf. Process. Lett..

[51]  Stephan Olariu,et al.  An Optimal Greedy Heuristic to Color Interval Graphs , 1991, Inf. Process. Lett..

[52]  Nicolas Zufferey,et al.  A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..

[53]  Isabel Méndez-Díaz,et al.  A Branch-and-Cut algorithm for graph coloring , 2006, Discret. Appl. Math..

[54]  Madhumangal Pal,et al.  An Optimal Parallel Algorithm to Color an Interval Graph , 1996, Parallel Process. Lett..

[55]  Madhumangal Pal,et al.  An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid Graphs , 2002, Int. J. Comput. Eng. Sci..

[56]  Madhumangal Pal,et al.  An Optimal Parallel Algorithm for All-Pairs Shortest Paths on Unweighted Interval Graphs , 1997, Nord. J. Comput..

[57]  Paolo Toth,et al.  An exact approach for the Vertex Coloring Problem , 2011, Discret. Optim..

[58]  Klaus Jansen,et al.  The mutual exclusion scheduling problem for permutation and comparability graphs , 1998, Inf. Comput..

[59]  Frédéric Gardi.  Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms , 2006, 4OR.