- enter memory cap for 1 container
- fixed popln size
- target number of islands needed
algorithm: essentially a packing problem
assign problems in highest memory to lowest memory, 1 per device till cap is met
p_i - memory needed for problem i n_i - target instances for container i m_j -
- fix problem store
- add problem metadata
- remove problem
- add scheduler