Scheduling Problems and Mixed Graph Colorings
From MaRDI portal
Publication:3150263
DOI10.1080/0233193021000004994zbMath1007.90027OpenAlexW1994012687WikidataQ57633947 ScholiaQ57633947MaRDI QIDQ3150263
Yuri N. Sotskov, Vyacheslav Tanaev, Frank Werner
Publication date: 28 November 2002
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0233193021000004994
Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Related Items
Coloring some classes of mixed graphs ⋮ Using mixed graph coloring to minimize total completion time in job shop scheduling ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring ⋮ On two coloring problems in mixed graphs ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Routing equal-size messages on a slotted ring ⋮ On the complexity of the selective graph coloring problem in some special classes of graphs ⋮ On weak chromatic polynomials of mixed graphs ⋮ A note on mixed tree coloring ⋮ Tutte polynomials for directed graphs ⋮ Mixed graph edge coloring ⋮ A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
