Search - gzfp - CodeBus

Search - gzfp - List

[Windows Develop] gzfp DL : 0: 假设有n个任务由k个可并行工作的机器完成。完成任务i需要时间为Ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。 -Suppose there are n-task by the k-parallel machine can be completed. I need time to complete the task Ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.
Date : 2025-07-11 Size : 1kb User : 孙云