The multifit algorithm is an algorithm for multiway number partitioning, originally developed for the multiprocessor scheduling problem.It was developed by Coffman, Garey and Johnson. They proved that it always returns a partition in which the largest sum is at most 1.220 times the optimum.[1]
References
- ^ Coffman, Jr., E. G.; Garey, M. R.; Johnson, D. S. (1978-02-01). "An Application of Bin-Packing to Multiprocessor Scheduling". SIAM Journal on Computing. 7 (1): 1–17. doi:10.1137/0207001. ISSN 0097-5397.
{{cite journal}}: CS1 maint: multiple names: authors list (link)