摘要
柔性流水作业排序问题是一类复杂的车间作业调度问题。针对通常情况下调度问题求解困难的问题,给出了求解柔性流水作业排序问题近似解的贪心算法,并对其性能进行了分析测试。结果表明,虽然该贪心算法求出的近似解与最优解相比有一定误差,但由于其时间复杂度较小,因此对求解车间作业调度问题仍有一定的现实意义。
Flexible flow shop scheduling problem is a complex job shop scheduling problem. And the problem has polynomial difficulty. Most of the other cases the problem has NP difficulty. In order to solve the problem, a greedy algorithm to solve flexible flow shop scheduling is given, and the capability of the algorithm is evaluated. Even the approximate result solved by the greedy algorithm has a certain error with the optimal result; however, it has small time complexity, so it still makes sense to the job shop scheduling problem solving.
出处
《吉林大学学报（信息科学版）》
CAS
2009年第6期585-589,共5页
Journal of Jilin University（Information Science Edition）
基金
国家863计划基金资助项目(2002AA145050)
教育部高等学校科技创新工程基金资助项目(708026)
