有能力约束的单机经济批量计划问题优化模型

Optimization Study of Single-machine ELSP Under Capability Constraints

有能力约束的单机经济批量计划问题是企业管理中的一重要问题,在企业信息化软件开发中具有重要的实际应用意义。在国内外研究的基础上,建立了求解有能力约束的单机经济批量计划问题的数学模型。由于上述问题为NP难问题,根据模型解的特征,采用遗传算法的原理,设计了求解上述模型的遗传算子和流程,利用dephi编程得出了计算结果。结果表明,算法效果优于唐立新 (1999)的结果;且在有能力约束的情况下,算法得出的结果接近无能力约束的情形,充分说明了该算法的有效性。

Based on the outcomes of scientific research on ELSP, the authors put forward a mathematic model to solve Single-machine Economic Lot sizes Scheduling Problem under capability contraints. For ELSP is a NP hardness, we solve the problem with GA (Genetic algorithm) according to the charictistics of the model and achieve the numerical results by phi. The results indicate that our results are better than literature. At the same time our results approach the results under no capability contraints that sufficiently prove the validity of our algorithm.