欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
无等待（No-wait）流程车间调度问题要求每个工件从加工开始至结束，必须连续进行，不允许其在完成某一工序后滞留在任一机器上．基于对目标函数的结构分析，提出一种基于最小化工件间距离的初始排序策略，结合插入方法的启发式算法．通过与文献中的启发式算法在对大量典型算例的比较后，实验数据验证了提出的算法在解的质量上超越了其它算法．
英文摘要：
No-wait flow shops characterized as the continuity of job in processing, once it begins, subsequent processing must be carried out with no delay in the passage of the job from machine to machine. Addressing the problem with objective of makespan, a constructive heuristic algorithm based on the distance of jobs and the insertion method was proposed in this article for No-wait flow-shop scheduling with objective of makespan. Computational results and comparisons based on benchmarks demonstrated the effectiveness of the proposed algorithm than other heuristic algorithms.
同期刊论文项目
同项目期刊论文
pplication Architecture of Data Mining in Telecom Customer Relationship Management Based on Swarm In
Fuzzy Programming For Multiobjective Fuzzy Job Shop Scheduling With Alternative Machines Through Gen
期刊信息
位置：