Description: Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is 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
- [jiqishejixiuzheng] - A machine by the n-components, each comp
- [FlowShop] - With c++ Realized the issue of batch job
- [greedyalgorithm] - Greedy algorithm- the task scheduling pr
- [zuijiadiaodusuanfa] - The use of backtracking to achieve the b
- [shizi] - best height of the problem. Problem desc
- [gzfp] - Suppose there are n-task by the k-parall
- [flexiblejobshop] - flexible job shop
- [suanfa2] - Some classic algorithms, including: half
File list (Check if you may need any files):
Desktop\mange_problem_trace_back.cpp
.......\New Microsoft Word 文档.docx
Desktop
Download