Search - PARALLEL MACHINE SCHEDULING

Search - PARALLEL MACHINE SCHEDULING - List

[.net] Machine DL : 0: 最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Optimal scheduling problem, assuming there are n a task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design a complete algorithm to find the optimal scheduling of tasks n, make the time to complete all tasks first.
Date : 2025-12-21 Size : 1kb User : 李晓明