摘要
混合流水车间 (Flowshop)提前 /拖期调度问题的目标是使工件的提前 /拖期惩罚成本最小 ,这是一个NP完全问题 ,很难用一般的方法解决。文中首先给出了问题的数学模型 ,然后采用联姻遗传算法求解该问题。
The objective of earliness and tardiness hybrid flowshop scheduling problem is to minimize the total earliness and tardiness cost. It is a NP complete problem and can hardly be solved with usual method. In this paper, a model of this problem is presented and the allied genetic algorithm is constructed to solve it. The simulation results show that this method is effective in solving complex scheduling problem.
出处
《计算机应用》
CSCD
北大核心
2004年第7期122-124,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目 (60 1 0 4 0 0 9)
