摘要
多品种、有能力约束的批量问题是多品种批量生产中生产计划的关键性问题．这一问题就是要确定：在每一期生产多少产品以使得所用费用最少且满足已知的每一期的需求量．本文设计了一种模拟退火算法的实现形式，通过大量的算例分析表明。
The multi item capacitated lot sizing problem consists of determining the magnitude and the timing of some operations of durable results for several items in a finite number of processing periods so as to satisfy a known demand in each period. An approximation algorithm is described, which is based on simulated annealing algorithm. The method incorporates a primal partitioning scheme?? #with a network flow subproblem?? #to obtain good feasible solutions.
出处
《北京航空航天大学学报》
EI
CAS
CSCD
北大核心
1999年第5期588-591,共4页
Journal of Beijing University of Aeronautics and Astronautics
基金
国家自然科学基金
关键词
批量
启发式
网络流
模拟退火算法
生产计划
lot size
heuristic approach
network flows
multi item
simulated annealing
production planning
