Scheduling Problems and Mixed Graph Colorings

DOI10.1080/0233193021000004994MaRDI QIDQ3150263zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

vertex coloring

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 1594564
• A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
• scientific article; zbMATH DE number 1731177
• Mixed graph edge coloring
• Mixed graph colorings

Cited in

(27)

• Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions
• Routing equal-size messages on a slotted ring
• scientific article; zbMATH DE number 1594564 (Why is no real title available?)
• Parameterized mixed graph coloring
• A note on mixed tree coloring
• scientific article; zbMATH DE number 7203465 (Why is no real title available?)
• “Rent-or-Buy” Scheduling and Cost Coloring Problems
• scientific article; zbMATH DE number 1731177 (Why is no real title available?)
• 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
• Coloring some classes of mixed graphs
• scientific article; zbMATH DE number 3910116 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 3435543 (Why is no real title available?)
• A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
• Mixed graph edge coloring
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times
• Vyacheslav Tanaev: contributions to scheduling and related areas

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)