摘要
很多生产加工企业需要按预定交货期来安排柔性流水作业的生产,本文研究带有交货期的多阶段流水作业排序问题,以最小化误工成本为优化目标,利用改进的明显误工成本作为优先因子完成第一阶段排序,再采用先到先服务的规则对后续阶段排序。算法能解决三个及更多阶段的作业排序问题,实例应用表明了算法的有效性。
Many manufacturing enterprises require thescheduling of flow shops with due dates. This paper presents an algorithm for the flexible flow shops schedulingwith due dates of jobs, the objective of minimizing total weighted tardiness costsby using theimproved apparent tardiness costsas the priority factors todetermine job dispatching sequence in the first stage andusing the rule of FCFS in the rest stages. This algorithm can schedule jobs of flexible flow shops with more than three stages. An application result demonstratesthat the algorithm has better efficiency.
出处
《上海管理科学》
CSSCI
2013年第6期10-11,15,共3页
Shanghai Management Science
关键词
交货期
柔性流水作业
加权误工成本
Job due dates
Flexible flow shops
Weighted tardiness costs
