scientific article
From MaRDI portal
Publication:2784175
zbMath0998.68092MaRDI QIDQ2784175
Yuri N. Sotskov, Alexandre Dolgui, Frank Werner
Publication date: 17 April 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
On some applications of the selective graph coloring problem ⋮ Coloring some classes of mixed graphs ⋮ Using mixed graph coloring to minimize total completion time in job shop scheduling ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ Minimizing makespan for multi-spindle head machines with a mobile table ⋮ A note on mixed tree coloring ⋮ Minimum Scan Cover with Angular Transition Costs ⋮ Mixed graph edge coloring
This page was built for publication:
