Scheduling Problems and Mixed Graph Colorings
From MaRDI portal
Publication:3150263
DOI10.1080/0233193021000004994zbMATH Open1007.90027OpenAlexW1994012687WikidataQ57633947 ScholiaQ57633947MaRDI QIDQ3150263FDOQ3150263
Authors: 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
Recommendations
Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Cited In (27)
- Routing equal-size messages on a slotted ring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameterized mixed graph coloring
- A note on mixed tree coloring
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
- Title not available (Why is that?)
- On two coloring problems in mixed graphs
- List-graph colouring for multiple depot vehicle scheduling
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- Title not available (Why is that?)
- Coloring some classes of mixed graphs
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
- Tutte polynomials for directed graphs
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- On the complexity of the selective graph coloring problem in some special classes of graphs
- Plurigraph coloring and scheduling problems
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
- Extensions of coloring models for scheduling purposes
- On weak chromatic polynomials of mixed graphs
- Turán problems for mixed graphs
- Title not available (Why is that?)
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times
- Mixed graph edge coloring
- Vyacheslav Tanaev: contributions to scheduling and related areas
- Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions
This page was built for publication: Scheduling Problems and Mixed Graph Colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150263)
