搜索资源列表
批处理作业调度
- 批处理作业调度问题要求对于给定的n个作业，制定最佳作业调度方案，使其完成时间和最小-batch scheduling requirements for the issue to the n operations, the best scheduling program, and to fulfill the minimum time
pichulizuoyediaodu
- 批处理作业调度问题，用VC++ 实现，代码可直接运行，
分支限界法_批处理作业调度
- 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC + + prepared
FlowShop
- 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data us
FlowShop
- 批处理作业调度 回溯法 c++语言编写的批处理作业调度问题算法-flowshop
zuoyediaodu
- 算法设计中经典的批处理作业调度问题，是多机器多任务的调度-Algorithm design in the classic problem of a batch job scheduling, multi-tasking is a multi-machine scheduling
cc
- 这是操作系统的批处理作业调度问题，采用响应比高者调度算法-This is the operating system batch job scheduling, scheduling algorithm using response is high and who
duodao
- 多道批处理系统 用于作业的进程调度 修改哲学家就餐问题-Multi-channel system for batch process scheduling jobs to modify the dining philosophers problem
duodao2
- 多道批处理系统 用于作业的进程调度 修改哲学家就餐问题-Multi-channel system for batch process scheduling jobs to modify the dining philosophers problem
pichuli5.3
- 分支限界法解决批处理作业调度问题 算法分析与设计-Branch and bound method to solve the problem of batch job scheduling