Publication:2784175
From MaRDI portal
zbMath0998.68092MaRDI QIDQ2784175
Yuri N. Sotskov, Alexandre Dolgui, Frank Werner
Publication date: 17 April 2002
68R10: Graph theory (including graph drawing) in computer science
Related Items
Minimum Scan Cover with Angular Transition Costs, Unnamed Item, A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring, Coloring some classes of mixed graphs, Using mixed graph coloring to minimize total completion time in job shop scheduling, Minimizing makespan for multi-spindle head machines with a mobile table, A note on mixed tree coloring, Mixed graph edge coloring, Parameterized mixed graph coloring, On two coloring problems in mixed graphs, Vyacheslav Tanaev: contributions to scheduling and related areas, On the complexity of the selective graph coloring problem in some special classes of graphs, On some applications of the selective graph coloring problem, A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach