All geek questions in one place

How would I optimally pack a set of tasks into a minimum number of time intervals?

I have a set of nindependent tasks and mtime intervals with the same fixed length f, each task of arbitrary length <= f.

How to distribute tasks in time intervals while minimizing m?

+4
source share
2 answers

You are looking at the problem of packaging packaging, which is NP-complete. However, there are good approximate polynomial solutions.

Refer to this link: http://en.wikipedia.org/wiki/Bin_packing_problem

+2
source

FFD ( ), , .

  • , .
  • .
  • , , .
  • .
  • , 2.

11/9*OPT + 1, 22% , .

+1

Source: https://habr.com/ru/post/1583766/

More articles:


All Articles