Graph coloring dynamics: A simple model scenario for distributed decisions in production logistics

Graph coloring is the process of placing colors onto and modifying the color of nodes of a network until no neighbors share the same color. It is a powerful tool for analyzing coloring strategies that could be mapped to job shop scheduling strategies. We analyze how the performance of solving temporal conflict graphs depends on strategy and problem complexity. We observe for example under strategic waiting of nodes, some network features that can be exploited to better solve conflicts on graphs. We show how these features can be used in the design of robust production networks.