文件名称:flowshop
介绍说明－－下载内容均来自于网络，请自行研究使用
流水作业调度问题的动态规划算法,流水作业调度问题要求确定这n个作业的最优加工顺序,使得从第一个作业在机器M1上开始加工,到最后一个作业在机器M2上加工完成所需的时间最少。-
Dynamic programming algorithm for flow shop scheduling problems, flow-shop scheduling problems required to determine the optimal processing sequence which n jobs, so the first job starts working on the machine M1, to the last machining operation on the machine M2 required to complete the minimum time.
Dynamic programming algorithm for flow shop scheduling problems, flow-shop scheduling problems required to determine the optimal processing sequence which n jobs, so the first job starts working on the machine M1, to the last machining operation on the machine M2 required to complete the minimum time.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
flowshop.cpp