Abstract
A variation of preemptive open shop scheduling corresponds to finding a feasible edge coloring in a bipartite multigraph with some requirements on the size of the different color classes. We show that for trees with fixed maximum degree, one can find in polynomial time an edge k-coloring where for i=1,…, k the number of edges of color i is exactly a given number h i , and each edge e gets its color from a set ϕ( e) of feasible colors, if such a coloring exists. This problem is NP-complete for general bipartite multigraphs. Applications to open shop problems with costs for using colors are described.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call