047: Supply Chain Coordinations

These results were achieved using this algorithms described by Burke et al. (see reference 1 on the references page). This technique uses aggregations to simplify the problem, and so the solutions are not guaranteed to be optimal.
The instance results consist of three parts:

Best cost: the cost of the best solution found
Delivery schedules: details of the number of batches of a product delivered per period between pairs of agents: product-name (agent-sender-name->agent-receiver-name).
Production schedules: details of the number of each product produced by each agent in each period: agent-name,product-name.