摘要
在按订单生产的制造系统中,有限的生产能力与严格的订单交货期要求决策者从若干候选订单中选择接受某些订单并编制生产计划。决策者需在订单收益与拖期惩罚之间进行权衡,以所有接受订单的实际收益之和最大为目标进行优化。提出了一种禁忌搜索算法用于求解考虑发布日期和队列准备时间的单机环境下的订单接受与调度问题。通过计算仿真方法模拟决策过程,并与两种现有的启发式算法比较,验证了提出的解法在收敛速度以及求解效果方面有更好的表现。
In a make-to-order production system,limited production capacity and strict order delivery date requires selection and acceptance from a set of candidate orders for production schedule.Order acceptance and scheduling decisions must trade-off to maximize total revenue.This paper presents a taboo search algorithm that solves the order acceptance and scheduling problem in the make-to-order production system on a single machine with release dates and sequence dependent setup time.Compared with two heuristics from the literature,the simulation experiment results show that the algorithm in this paper obtains near optimal solutions which are significantly better than the other two heuristics both with convergence and solution quality.
出处
《智能计算机与应用》
2013年第3期33-36,共4页
Intelligent Computer and Applications
基金
国家自然科学基金(61273038
61033005)
国家973计划项目(2010CB328004)
国家科技支撑计划项目(2013BAH17F03)
山东省科技攻关计划项目(2012GGX10309)
关键词
订单接受与调度
队列准备时间
禁忌搜索
计算仿真
Order Acceptance and Scheduling
Sequence Dependent Setup Time
Taboo Search
Computational Simulation
