Â¥Ö÷

º††ÎÔ^ NP-complete†–î} Ôõ˜Ó ʹÓà subset sum problem ×C multi-process scheduling problem ÊÇNPC? ÓÃpartition ÎÒ¶®£¬ß@‚€ÎÒ²»¶®¡­ ¸½ÉÏmulti-process scheduling problemµÄ¶¨Áx A multiset A of tasks, a measurement of the time required for each task l: A-->N, a deadline (real number) D; Is there a partition of A into m disjoint sets such that the total time (sum of l(a)) for every element in a partition is always at most D?    Êղؠ  ·ÖÏí   ¶¥(0)