Search - PARALLEL MACHINE SCHEDULING

Search - PARALLEL MACHINE SCHEDULING - List

[Data structs] ex DL : 0: 最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。 -Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to complete a full first mission.
Date : 2025-12-22 Size : 1kb User : 朱亚华