As resources become scarce and expensive, it has become increasingly important for players in a decentralised supply chain to collaborate. One of the main challenges in collaboration is to find close to globally optimal solutions without sharing individual player’s private data. Taking a decentralised resource constrained scheduling problem as an example we present a methodology which can be used to calculate correct lower and upper bounds on the objective functions without needing to share any private data from individual players.