Description: 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.
- [lqx10002] - best height of the problem. Problem desc
- [ex] - Optimal scheduling problem, assuming tha
- [priority] - err
- [Job_Arrary] - Have limited operating arrangements,
- [bxjdd] - Solve the parallel machine scheduling pr
- [BestSchedule] - BestSchedule, the best scheduling algori
- [tiaodu] - C++ program alorthim
- [Desktop] - Scheduling problem backtracking algorith
- [Machine] - Optimal scheduling problem, assuming the
File list (Check if you may need any files):
5_13.cpp
5_13input.txt
Download