自动化学报2003，Vol.29Issue(2)：296-300,5.
具有多种产品类型的最小订单提前/拖期问题
Minimizing Earliness-Tardiness Penalties of Orders with Multi-Product Classes
摘要
Abstract
This paper deals with the order planning of single machine with multi-product classes and sequence-independent setup times, and proposes a mixed integer-programming model to minimize the sum of earliness/tardiness penalties of orders. It presents a pseudo-polynomial algorithm based on the filtered beam search by discussing the NP-hardness and the necessary condition of adjacent groups in an optimal sequence. The computational complexity analysis and simulation results have confirmed the effectiveness of the algorithm.关键词
订单排产/成组技术/调整时间/提前/拖期/计算复杂性/拟多项式算法Key words
Order planning/group technology/setup times/earliness/tardiness/complexity/pseudo-polynomial algorithm分类
管理科学引用本文复制引用
王书锋,邹益仁..具有多种产品类型的最小订单提前/拖期问题[J].自动化学报,2003,29(2):296-300,5.基金项目
Supported by National 9th Five-year Key Plan Project of P.R.China(97-562-01-05) （97-562-01-05）
