Bin packing with Drools Planner: scheduling processes on cloud servers

A session at JUDCon/JAX London

Monday 31st October, 2011

10:00am to 11:00am (GMT)

Given a set of servers with different hardware (CPU, memory and network bandwidth) and given a set of processes with different hardware requirements, how can we assign each process to a server and minimize the total cost of all the active servers? This is an "NP complete" bin packing problem. So how do we find an optimal solution in reasonable time? And what if we want to solve it in real-time? This session will walk you through the code, implemented in Drools Planner. It will compare different optimization algorithms by the total cost of their solutions. And it includes demo's of course. JBoss Drools Planner optimizes planning problems, such as employee rostering, appointment timetabling, task scheduling, vehicle routing and bin packing.

About the speaker

This person is speaking at this event.
Geoffrey De Smet

Drools Planner optimizes planning problems.

Sign in to add slides, notes or videos to this session

JUDCon/JAX London

England England, London

31st October to 1st November 2011

Tell your friends!


Time 10:00am11:00am GMT

Date Mon 31st October 2011

Short URL


View the schedule



See something wrong?

Report an issue with this session