Time slot scheduling of compatible jobs

A version of weighted coloring of a graph is introduced which is motivated by some types of scheduling problems: each node v of a graph G corresponds to some operation to be processed (with a processing time w(v)), edges represent nonsimultaneity requirements (incompatibilities). We have to assign each operation to one time slot in such a way that in each time slot, all operations assigned to this slot are compatible; the length of a time slot will be the maximum of the processing times of its operations. The number k of time slots to be used has to be determined as well. So, we have to find a k-coloring $${\cal S}$$= $$({S_{1},\ldots ,S_{k}})$$ of G such that w(S1) + ⋅s +w(Sk) is minimized where w(Si) = max {w(v) :v∊V}. Properties of optimal solutions are discussed, and complexity and approximability results are presented. Heuristic methods are given for establishing some of these results. The associated decision problems are shown to be NP-complete for bipartite graphs, for line-graphs of bipartite graphs, and for split graphs.

[1]  Dominique de Werra,et al.  Chromatic Scheduling and Frequency Assignment , 1994, Discret. Appl. Math..

[2]  William J. Cook,et al.  Combinatorial Optimization: Cook/Combinatorial , 1997 .

[3]  Majid Sarrafzadeh,et al.  On the Sum Coloring Problem on Interval Graphs , 1999, Algorithmica.

[4]  D. de Werra,et al.  Heuristics for graph coloring , 1989 .

[5]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[6]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[7]  Zsolt Tuza,et al.  Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.

[8]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[9]  Klaus Jansen,et al.  Scheduling with Incompatible Jobs , 1992, WG.

[10]  Hans Ulrich Simon,et al.  On Approximate Solutions for Combinatorial Optimization Problems , 1990, SIAM J. Discret. Math..

[11]  Jiří Fiala.  NP completeness of the edge precoloring extension problem on bipartite graphs , 2003 .

[12]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[13]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[14]  Klaus Jansen,et al.  Approximation Results for the Optimum Cost Chromatic Partition Problem , 1997, J. Algorithms.

[15]  Stefanie Gerke.  Colouring weighted bipartite graphs with a co-site constraint , 2000, Discret. Math..

[16]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[17]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[18]  Dominique de Werra,et al.  Open shop scheduling with some additional constraints , 1996, Graphs Comb..

[19]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[20]  Chris N. Potts,et al.  Scheduling batches with simultaneous job processing for two-machine shop problems , 2001 .

[21]  Rainer E. Burkard.  Time-slot assignment for TDMA-systems , 2005, Computing.

[22]  V. Chvátal.  Perfectly Ordered Graphs , 1984 .

[23]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[24]  F. Rendl.  On the complexity of decomposing matrices arising in satellite communication , 1985 .

[25]  D. König.  Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[26]  Jirí Fiala.  NP completeness of the edge precoloring extension problem on bipartite graphs , 2003, J. Graph Theory.

[27]  Klaus Jansen,et al.  Generalized Coloring for Tree-like Graphs , 1992, WG.

[28]  D. de Werra,et al.  On some combinatorial problems arising in scheduling , 1970 .

[29]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

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

[31]  Vangelis Th. Paschos,et al.  Master-Slave Strategy and Polynomial Approximation , 2000, Comput. Optim. Appl..

[32]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.