搜索资源列表
4.tar
- 依据Johnson原则,应用贪心算法解决两处理机流水作业调度问题。注释详实,可读性好。-Johnson based on the principle of application of the greedy algorithm to solve the two processor flow-shop scheduling problem. Comments detailed, readable.
Flow-shop-scheduling
- 流水作业调度问题要求确定这n个作业的最优加工顺序,使得从第一个作业在机器 上开始加工,到最后一个作业在机器 上加工完成所需的时间最少。-Flow-shop scheduling problem requires to determine that the optimal n-job processing sequence, so the first job from start processing on the machine, to the last job on the machine p
Car1
- 流水车间调度问题,应该可以说是,最好的方法-flow shop