...《暨南大学》 2004年 加入收藏 车间作业排序问题(FSSP)蚂蚁算法研究 王雄志 【摘要】:一般车间作业排序问题(处理机数量≥3)是最困难的约束组合优化问题和典型的NP-Hard问题,其特点...
基于68个网页-相关网页
大多数一般的多于两台机床的流水车间作业排序问题均属于NPC问题,在实际生产中一般采用启发式算法。
Most flow shop sequencing problems with more than two machines belong to NPC problem. People often use heuristic algoristic algorithms to deal with them in practice.
基于交货期的模具车间作业调度问题是解决不同类型工件的加工排序,使其误工最少。
The mould manufacture scheduling based on due date is a problem of how to schedule operation processing sequence to minimize tardiness.
应用推荐